{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-1059"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"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":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"DM7","name":"Repository granularity","shortDescription":{"text":"Repository granularity"},"helpUri":"https://codehealth.canine.dev/dimensions/DM7"},{"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":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::handle (cyclomatic 181): risingwave_frontend::handler::handle has cyclomatic complexity 181 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/frontend/src/handler/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00f7b29341814f81523ab04fb8e0653c7fef0b8af11cdf59de07c4c4450c523"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement::fmt_unchecked (cyclomatic 148): Statement::fmt_unchecked has cyclomatic complexity 148 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/sqlparser/src/ast/mod.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"861759cfe5dcdb5fd37c4c4f033fb826b672ecadd9a35ac6e09eab2c5c80a05b"}},{"ruleId":"D1","level":"warning","message":{"text":"ParallelizedCdcBackfillExecutor::execute_inner (cyclomatic 90): ParallelizedCdcBackfillExecutor::execute_inner has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9296e43fc37615e0cbfd6c497c1db44b3e037bd5e2ac7b7323dd5fadafa7211d"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::expr::type_inference::func::infer_type_for_special (cyclomatic 88): risingwave_frontend::expr::type_inference::func::infer_type_for_special has cyclomatic complexity 88 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2b2e08dcd8b6a7b604dd5bd0fcd918dbfb0c22e5bc94956d05448442401271"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseCheckpointControl::apply_command (cyclomatic 79): DatabaseCheckpointControl::apply_command 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":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c992f1dd86205dc89d127af878dd616bbac45e78e2193b46e7a8cea52944ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParseOptions::parse (cyclomatic 74): JsonParseOptions::parse has cyclomatic complexity 74 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/unified/json.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6055bff2864a1eef9c281ef3bb0b9a305cff75bdca4be849f407b549e6521"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common::system_param::set_system_param (cyclomatic 73): risingwave_common::system_param::set_system_param 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":"src/common/src/system_param/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f1f9d24fb9b9a14f075c4f3d3c63f3fa8b1c6491d6b70bc649859e56d8cac1"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergCommon::build_jni_catalog_configs (cyclomatic 71): IcebergCommon::build_jni_catalog_configs 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":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e51f0fe8cceb1db10078875ce473a1df338a11928f4ce9dbb670594205095d"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontendObserverNode::handle_catalog_notification (cyclomatic 70): FrontendObserverNode::handle_catalog_notification 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":"src/frontend/src/observer/observer_manager.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec23f6e2662abbe2572ad39de56d9e55633131b3faec5b06d44d4fbba78c9ca3"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::fmt (cyclomatic 69): Expr::fmt has cyclomatic complexity 69 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/sqlparser/src/ast/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"d061a52d784da0ef88ec0790d47af569dabdd9f0e0323e365197738de72169dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer::next_token (cyclomatic 66): Tokenizer::next_token has cyclomatic complexity 66 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/sqlparser/src/tokenizer.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc96b3a95ac28f32ab1678b5aef4f2245921f239c36b5110ecdc004ed6b761aa"}},{"ruleId":"D1","level":"warning","message":{"text":"CdcBackfillExecutor::execute_inner (cyclomatic 64): CdcBackfillExecutor::execute_inner 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":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"302549b4314ce68390a409a76753f31284c7605e6cae26d185d0e8c83c8b70a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_builtin_scalar_function (cyclomatic 62): Binder::bind_builtin_scalar_function has cyclomatic complexity 62 (threshold 15). Of this number, 59 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":"src/frontend/src/binder/expr/function/builtin_scalar.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"da68c46b7574fe9b66544bb0931c203980204183de375a6bfc366ad612670030"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_ctl::start_impl (cyclomatic 61): risingwave_ctl::start_impl 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":"src/ctl/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"286272886eeaad79e7751bad45112d618c8a5dd97baa7ce7fd4ab8d1e5bfe293"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterializeExecutor::execute_inner (cyclomatic 60): MaterializeExecutor::execute_inner 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":"src/stream/src/executor/mview/materialize.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b768115fd675f2e742e46dd66bd81a60cfe2734c8e74bbd5e1d3a49b0851add"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceBackfillExecutorInner::execute (cyclomatic 59): SourceBackfillExecutorInner::execute 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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"360f8d16a471e01260a3e82edb844a275b609503ceb4b0acf3a1f346a269d60e"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementType::infer_from_statement (cyclomatic 59): StatementType::infer_from_statement 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":"src/utils/pgwire/src/pg_response.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6374231072e12fdd8a70a8f55624e11e0605d58647b825af15a7238c314310"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::resolve_binary_operator (cyclomatic 57): Binder::resolve_binary_operator has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/binary_op.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4408e753abb9641388fc39ad38a63f9e26401b0069940f4e7368fdd01f5f55dc"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_meta::controller::system_param::merge_params (cyclomatic 55): risingwave_meta::controller::system_param::merge_params has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/system_param.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8678d092af017c30ec380e7299fbac6f8cc8d60385307d6691acc82571741d07"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common::util::stream_graph_visitor::visit_stream_node_tables_inner (cyclomatic 53): risingwave_common::util::stream_graph_visitor::visit_stream_node_tables_inner has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/stream_graph_visitor.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbfdc1920d2256ae08dbaa6787c02107124f4ed41c0bdbadb304f6f0f77f5d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_expr_inner (cyclomatic 53): Binder::bind_expr_inner has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c4f531f1e40cc9de37cc319f2e357c0a4128f91474729ca76e21ec43a175c6"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_sink::gen_sink_plan (cyclomatic 53): risingwave_frontend::handler::create_sink::gen_sink_plan 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":"src/frontend/src/handler/create_sink.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"082cc7bab8873613a11577f413e573998c193d1b5628d594eb6fcbbba42a63fc"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceExecutor::execute_inner (cyclomatic 53): SourceExecutor::execute_inner 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":"src/stream/src/executor/source/source_executor.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8218ef67f5206348aba22414e8df1d01db956a9039ce3e5be2a9867d744459"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::sqlserver::bind_params (cyclomatic 52): risingwave_connector::sink::sqlserver::bind_params has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/connector/src/sink/sqlserver.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d48fccd241bc86b3a85878fbb7194e66ed437970fa8da5d89bc256ff222305f"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::encoder::avro::on_field (cyclomatic 52): risingwave_connector::sink::encoder::avro::on_field has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/connector/src/sink/encoder/avro.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71465c85ce2104a116b10c29b10d08ddadf126b134f6287dc1a33e286b33908"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalBarrierWorker::run_inner (cyclomatic 52): GlobalBarrierWorker::run_inner 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":"src/meta/src/barrier/worker.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a9cfbda261b95cbc76890c22b888ce8778e20eafe651b4eb8555da2da7ee5c"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::handle_privilege::make_prost_privilege (cyclomatic 51): risingwave_frontend::handler::handle_privilege::make_prost_privilege has cyclomatic complexity 51 (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":"src/frontend/src/handler/handle_privilege.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efe2174caa0672fe2744900e496c0d0930dbe83383aed6e8f18ed426623165c"}},{"ruleId":"D1","level":"warning","message":{"text":"AvroParseOptionsInner::convert_to_datum (cyclomatic 49): AvroParseOptionsInner::convert_to_datum has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/codec/src/decoder/avro/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4d9e36a19abb5daa0362f62bfda6c72129a90e18c1af1be7acf004f6208638"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::encoder::proto::on_field (cyclomatic 49): risingwave_connector::sink::encoder::proto::on_field has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/encoder/proto.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433ca9d2a852a05c96343acd80212e3514ddb08fef02a1365297fd0280f864a"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamSink::create (cyclomatic 49): StreamSink::create 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":"src/frontend/src/optimizer/plan_node/stream_sink.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"db068982037413d26e2f2dfedc6c600d52be9f2d7cbc8bd16bf1b848bb65aea3"}},{"ruleId":"D1","level":"warning","message":{"text":"BeMessage::write (cyclomatic 49): BeMessage::write has cyclomatic complexity 49 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_message.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad464b9eefae733027bf46fc899b5fedea682ef2f83060995c0da32e3bc5d03b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_infix (cyclomatic 47): Parser::parse_infix 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4a6107294cfda428bd37a9dd35c2151680ffcacf68650fc2c23849ac846c6c"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlServerStreamingChangeEventSource.executeIteration (cyclomatic 46): SqlServerStreamingChangeEventSource.executeIteration 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/sqlserver/SqlServerStreamingChangeEventSource.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7b0de5f1f805e246ca931a219f25015077ec4667d29f12dfc290c7aeded7b0"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamChunkDeserializer.buildValueGetter (cyclomatic 46): StreamChunkDeserializer.buildValueGetter has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/deserializer/StreamChunkDeserializer.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfed329696a9577f182b567dbe7432e2e94c5f81d99b96b09945fd192d4833d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_prefix (cyclomatic 43): Parser::parse_prefix has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce44a5c3d57fcbb0862055f845cbbc0aede2bc2f8f2df5cb1a6caba007b2d63"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrangementBackfillExecutor::execute_inner (cyclomatic 43): ArrangementBackfillExecutor::execute_inner has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/arrangement_backfill.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ca2ce2eb92bd542486576136175a7bba338edab005afd6467e55843b29ddf2"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_function (cyclomatic 42): Binder::bind_function 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":"src/frontend/src/binder/expr/function/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"564fcc8e104e23b614f479045c37b556b1b5a00f06b1ad2447b1ac9a04112ba1"}},{"ruleId":"D1","level":"warning","message":{"text":"HashJoinExecutor::do_execute (cyclomatic 41): HashJoinExecutor::do_execute 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"2682ae616add5019f5d52e8dd2dc0df035080f3727ffc0b59c259e160ae8a578"}},{"ruleId":"D1","level":"warning","message":{"text":"DmlExecutor::execute_inner (cyclomatic 41): DmlExecutor::execute_inner 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":"src/stream/src/executor/dml.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e9dfa43850eec15b7cb25c5c9ff3ac91b74d6f775baba1df50c36cb8701cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalityProviderExecutor::execute_inner (cyclomatic 41): LocalityProviderExecutor::execute_inner 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":"src/stream/src/executor/locality_provider.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9061e75c4b9f44f95eca73c39658e2a6ee8d0a0ea33d6093127e322fe6b10f98"}},{"ruleId":"D1","level":"warning","message":{"text":"DbzConnectorConfig.\u003Cinit\u003E (cyclomatic 41): DbzConnectorConfig.\u003Cinit\u003E 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"db251f83fcb22981d66ac78ea1b2994ed8257a9f09349df6a50cadf0a6849599"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::encoder::json::datum_to_json_object (cyclomatic 40): risingwave_connector::sink::encoder::json::datum_to_json_object 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":"src/connector/src/sink/encoder/json.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bfe92371018c0d2037f0f2a74a703516043c4de40fbee517638be8854a3860"}},{"ruleId":"D1","level":"warning","message":{"text":"MonotonicityAnalyzer::visit_function_call (cyclomatic 40): MonotonicityAnalyzer::visit_function_call 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":"src/frontend/src/optimizer/property/monotonicity.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec68c4d192c6f64a7bf2b86416944d33ec35d691c8ac83774e6d627566653404"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionAttr::generate_build_scalar_function (cyclomatic 39): FunctionAttr::generate_build_scalar_function has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/macro/src/gen.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dba55856c53c433af0235f32f7c52b99ec5d47f2904f0fdd05fdda15455492"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCase::apply_query (cyclomatic 39): TestCase::apply_query 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":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4d6b89af088050b787a772813c7942a619ffa3d2242fcd278da27b00a04bd3"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_index::gen_create_index_plan (cyclomatic 39): risingwave_frontend::handler::create_index::gen_create_index_plan 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":"src/frontend/src/handler/create_index.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cd788d17a51713ac0500732e2d282644933dcadca8bb563487c21c64dfd492"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_meta::hummock::manager::compaction::compaction_group_manager::update_compaction_config (cyclomatic 39): risingwave_meta::hummock::manager::compaction::compaction_group_manager::update_compaction_config has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_group_manager.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"75762916acfec09705c388a96bea2b6c5411e71a77e42b4a1969e813928544fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_match_recognize (cyclomatic 38): Binder::bind_match_recognize 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2e9011d6daac8049bcbd69e56d26c5c7315a97390aef0dfe4950dd6ad24377"}},{"ruleId":"D1","level":"warning","message":{"text":"NavExtractor::rewrite (cyclomatic 38): NavExtractor::rewrite has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abad38cdf45e4dbffe5d5dbb7ea7c8dadf8b54f3da5ce9e94f24d4c7c99248b"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_backup::meta_snapshot_v2::encode_metadata_to_writer (cyclomatic 38): risingwave_backup::meta_snapshot_v2::encode_metadata_to_writer has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (risingwave_backup::meta_snapshot_v2::decode_metadata_from_reader) 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":"src/storage/backup/src/meta_snapshot_v2.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24a7dc70a4b0739018f59982b3b36f3b44dff0db3c06de171cf3a7e487be7da"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_backup::meta_snapshot_v2::decode_metadata_from_reader (cyclomatic 38): risingwave_backup::meta_snapshot_v2::decode_metadata_from_reader has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (risingwave_backup::meta_snapshot_v2::encode_metadata_to_writer) 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":"src/storage/backup/src/meta_snapshot_v2.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a238c90d568971851ae24df2e3ab43d44f8817bcbf5747e6bdb425f824372ac2"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::start_iceberg_compactor (cyclomatic 38): risingwave_storage::hummock::compactor::start_iceberg_compactor 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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"024b41601bdf414d9fb68103127577bccd03bad42cb9735c2959dbd159508a83"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common::system_param::derive_missing_fields (cyclomatic 37): risingwave_common::system_param::derive_missing_fields 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":"src/common/src/system_param/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"db090c94f712c74a3981181e80e313d6f5711550bbbbd9f64e017375cea115f9"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::parser::unified::debezium::extract_bson_field (cyclomatic 37): risingwave_connector::parser::unified::debezium::extract_bson_field 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc375586acbd11dec1e791c0a453d52e9e71c95f514f3f5c635845d975e1c92"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::binder::expr::bind_data_type (cyclomatic 37): risingwave_frontend::binder::expr::bind_data_type has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/mod.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ade8a2e08cffdefbde40c2ace459f82e67c808f293817e2348a19909953052e"}},{"ruleId":"D1","level":"warning","message":{"text":"WatermarkFilterExecutorInner::execute_inner (cyclomatic 37): WatermarkFilterExecutorInner::execute_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":"src/stream/src/executor/watermark_filter.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f58804bd74f3b1f3e754c6e344b1b0b4c78ea900a21e03ddea829e93267336e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClickHouseFieldWithNull::from_scalar_ref (cyclomatic 36): ClickHouseFieldWithNull::from_scalar_ref 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":"src/connector/src/sink/clickhouse.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"87beff6c455db061fd2d4540094318914efc29d73e7b1079ed89e48fc5ad5c11"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::source::cdc::external::mysql::mysql_type_to_rw_type (cyclomatic 36): risingwave_connector::source::cdc::external::mysql::mysql_type_to_rw_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. This is NOT this file\u0027s highest cyclomatic complexity: risingwave_connector::source::cdc::external::mysql::type_name_to_mysql_type (cyclomatic 49) 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":"src/connector/src/source/cdc/external/mysql.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"859a420c47e7cdfdb4146b0c2b0a1d9cc93a07872895fa497a51204da938ab66"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_expr_impl::scalar::to_char::format_inner (cyclomatic 36): risingwave_expr_impl::scalar::to_char::format_inner 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":"src/expr/impl/src/scalar/to_char.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6cb0e97a1e121df4192055cd4bfe4362ad0e641d9d7b1e5445d14e1cb9c777"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::drop_object (cyclomatic 36): CatalogController::drop_object 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":"src/meta/src/controller/catalog/drop_op.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7058b5bfa0c7797aab2e843d38ffb6a61ace6113d091a88d085b322480d407f8"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::parser::unified::debezium::bson_extract_number (cyclomatic 35): risingwave_connector::parser::unified::debezium::bson_extract_number 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3fbb47e00319687a23b88af2812a56d7fce46d5810592f14a8c8a324c0d86e"}},{"ruleId":"D1","level":"warning","message":{"text":"risedev::bin::risedev-dev::task_main (cyclomatic 35): risedev::bin::risedev-dev::task_main has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8871dbe9631316b067f0c1a3dfde8849f2eefdf08a264dcde947172989128888"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector_codec::decoder::avro::schema::avro_type_mapping (cyclomatic 34): risingwave_connector_codec::decoder::avro::schema::avro_type_mapping 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":"src/connector/codec/src/decoder/avro/schema.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9553c30ea7bd6ae1510935dee5daf1d9556b9d3dcad3c559d12c10e5d1800a6"}},{"ruleId":"D1","level":"warning","message":{"text":"AsOfJoinExecutor::eq_join_right (cyclomatic 34): AsOfJoinExecutor::eq_join_right 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":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a468a24ad24cb6a436275e4a635612c6e147171241d57566450a647388ff3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ListValue::from_str (cyclomatic 33): ListValue::from_str 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":"src/common/src/array/list_array.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"d845fab4df088af0a8f0b15828e9b0128b897d0d43729d55d3aa580398a0371b"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::stream_fragmenter::build_fragment (cyclomatic 33): risingwave_frontend::stream_fragmenter::build_fragment has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/stream_fragmenter/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ac5c86d55b46c951b4503c1f613fe649474a121d405b9b400e39bbfc5589d4"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::explain::do_handle_explain (cyclomatic 33): risingwave_frontend::handler::explain::do_handle_explain has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/explain.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24607890d03535e779a626b668cb8334a3720e6c11bfa50547e119810ce83d9"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalBarrierWorker::recovery_inner (cyclomatic 33): GlobalBarrierWorker::recovery_inner 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":"src/meta/src/barrier/worker.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a792c063d240aa7406240a3378a877edebcec14c1d7ec88d171d51887d4e5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_alter_table (cyclomatic 33): Parser::parse_alter_table has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1092a47c3c5a8b4791dd20ff15720a0798a65ee1943e6da5e595501a8949388"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgresValidator.validatePublicationConfig (cyclomatic 33): PostgresValidator.validatePublicationConfig 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7d1cd0b0eda1401095c0cc7f0f14cc19ad596048aa8e74f9cd155cadfa018c"}},{"ruleId":"D1","level":"warning","message":{"text":"FragmentGraph.FragmentGraph (cyclomatic 33): FragmentGraph.FragmentGraph has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 4 of the 33 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 242, 384, 477, \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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd659a97c0168026a3a1c9e7b13fe61a04df0cbd24654b87bd601ad51ff5634b"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionAttr::generate_agg_build_fn (cyclomatic 32): FunctionAttr::generate_agg_build_fn 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":"src/expr/macro/src/gen.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f7139cb13381868fa9914635669185599af1f69ac20da238e868cfc988ba07"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::hummock::compaction_group::build_compaction_config_vec (cyclomatic 31): risingwave_ctl::cmd_impl::hummock::compaction_group::build_compaction_config_vec 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":"src/ctl/src/cmd_impl/hummock/compaction_group.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f443d6d6020fee928fd9f4619a23d8e2a51c5075de212023a3908e902421f9cc"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::show::handle_show_object (cyclomatic 31): risingwave_frontend::handler::show::handle_show_object 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":"src/frontend/src/handler/show.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22a61bfb75317b67374dcf426ae074ab875f6b708e18479dc961e24947990c8"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::optimizer::plan_node::logical_kafka_scan::expr_to_kafka_timestamp_range (cyclomatic 31): risingwave_frontend::optimizer::plan_node::logical_kafka_scan::expr_to_kafka_timestamp_range 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":"src/frontend/src/optimizer/plan_node/logical_kafka_scan.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e97fd5498f3719ecefa584781f2f1e9b30175a6361581954166bf9affd29edb"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_alter_view (cyclomatic 31): Parser::parse_alter_view 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. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"688192930fb9fc22a4e68c7000f6d9dbf6ebd835005417fa9d3ed39813f4af25"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplayWorker::handle_record (cyclomatic 31): ReplayWorker::handle_record 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":"src/storage/hummock_trace/src/replay/worker.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7976527e1be929d7df7f980a856233cd2115c3c1c3dad0b020dd8ebd9bb05465"}},{"ruleId":"D1","level":"warning","message":{"text":"Decimal::checked_powd (cyclomatic 30): Decimal::checked_powd 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":"src/common/src/types/decimal.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c57ab8bf1311403165baaf390dbe0e04fe74db429828cc3d0be658c6a8cfbd0"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::lower_measure (cyclomatic 30): Binder::lower_measure 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8318e0503e13cff9c468853bc3904b0b9bba3d31950f53171bbf130f8a9961ae"}},{"ruleId":"D1","level":"warning","message":{"text":"CorrelatedTopNToVectorSearchRule::apply (cyclomatic 30): CorrelatedTopNToVectorSearchRule::apply 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":"src/frontend/src/optimizer/rule/correlated_topn_to_vector_search.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"682a487bb94ad098815c65d66e8dc4c8bcf885ac0ad7d4916c026144f1493eef"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalQueryExecution::convert_plan_node (cyclomatic 30): LocalQueryExecution::convert_plan_node has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9521d957750f292d85ca776a5289701f8ea5c0bb497dc1f36cc9b0b58688e71"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::start_compactor (cyclomatic 30): risingwave_storage::hummock::compactor::start_compactor has cyclomatic complexity 30 (threshold 15). Of this number, 29 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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27e071e6b91689d4fca48581649e9a40bb40bb28930295038409c3e000be82f"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::execute (cyclomatic 30): Inner::execute 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":"src/stream/src/executor/project/project_set.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0a6ca6c06ee055290239f65ccb0736c1c530aed3011a69a2927963d822ba31"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergConnection::validate_connection (cyclomatic 29): IcebergConnection::validate_connection 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":"src/connector/src/connector_common/connection.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2dbc7ede1dcdcaad6b1119433ff2bc6fb5276eeaf3a91aebfdea109c06e23d"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTimezone::with_timezone (cyclomatic 29): SessionTimezone::with_timezone 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":"src/frontend/src/expr/session_timezone.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c74d2384d29a2a285854eec0e745eb267e4b7dc8a55c2f0887f125d1df6a28e"}},{"ruleId":"D1","level":"warning","message":{"text":"TableFunction::new_file_scan (cyclomatic 29): TableFunction::new_file_scan 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":"src/frontend/src/expr/table_function.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a59b59fbca8d168f2f197bac7fd66df6c9604083bcdeb60577c5972beb9bfdc"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::alter_user::alter_prost_user_info (cyclomatic 29): risingwave_frontend::handler::alter_user::alter_prost_user_info 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":"src/frontend/src/handler/alter_user.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"90930c2d9ee9cbce473a08961fcbf7bbe25a2f249714b46df4ce95a30c3f544e"}},{"ruleId":"D1","level":"warning","message":{"text":"OverWindowExecutor::apply_chunk (cyclomatic 29): OverWindowExecutor::apply_chunk 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":"src/stream/src/executor/over_window/general.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a450551c0d61705a2974bbb92aacbc7b71a95e23038d3c6553aea0edeeb8acf"}},{"ruleId":"D1","level":"warning","message":{"text":"SnowflakeV2Config::from_btreemap (cyclomatic 28): SnowflakeV2Config::from_btreemap 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":"src/connector/src/sink/snowflake_redshift/snowflake.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fdbb0ea1e29c5784e5d595a9b5876bc1ede4f32b95895002d64f8121d93669"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::parser::unified::debezium::parse_schema_change (cyclomatic 28): risingwave_connector::parser::unified::debezium::parse_schema_change 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46e454d862a190e89cbafa1e4bf199ed35fc76ce767f21954da820c2c4a1a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::plan_select (cyclomatic 28): Planner::plan_select 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":"src/frontend/src/planner/select.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d635ea4474ed716191372eccbd33c9d4707832648fa5ef98cadd49dc3f699c4e"}},{"ruleId":"D1","level":"warning","message":{"text":"Condition::disjunctions_to_scan_ranges (cyclomatic 28): Condition::disjunctions_to_scan_ranges has cyclomatic complexity 28 (threshold 15). Of this number, 22 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ad9173cd7b84d3d11e59e9bb6dfdc08ad7affef21038ff9ea3c934ef07dc9b"}},{"ruleId":"D1","level":"warning","message":{"text":"Condition::analyze_group (cyclomatic 28): Condition::analyze_group 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b48847b17df396006687e5e793fd0103bf8201b7edc8ef55dd1669793dee4e"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::bind_create_source_or_table_with_connector (cyclomatic 28): risingwave_frontend::handler::create_source::bind_create_source_or_table_with_connector 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":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e1305620f77420c430569d6dcbe7e926e5ed016f8b0c7bdfe9a6092c793c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"risedev::risedev_env::generate_risedev_env (cyclomatic 28): risedev::risedev_env::generate_risedev_env 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":"src/risedevtool/src/risedev_env.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d836bf5c54968e7d3cc033dad60e7d82fc44bb1a531941bbdd46675e9375b13"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_table_and_joins (cyclomatic 28): Parser::parse_table_and_joins has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":5495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4922efb5fe9e5ed1f0c1b931ab8144f9162aa82c2fae51e5755fd5a894757162"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockVersionCommon::apply_version_delta (cyclomatic 28): HummockVersionCommon::apply_version_delta 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":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1263ee8cc21efa7919ba132bbd8163899565651f0dcc4b77e97c61a7e21e3e0d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutorInner::generate_filled_rows (cyclomatic 28): ExecutorInner::generate_filled_rows 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":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"285522144fccb36d32a3dd98b5b23e4dd9e4508a868459202c3abd08314f9d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.process_file (cyclomatic 28): extract.process_file 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":"docs/metrics/extract.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d09bd1f4af2469af88c77cfa53a394904e75e7fdb38aa7a4855c0670bb126ab"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaConnectionProps::set_security_properties (cyclomatic 27): KafkaConnectionProps::set_security_properties 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":"src/connector/src/connector_common/common.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b827ae4a24a93b630e890afe5d3a095091a766c0e09f807a2dd9d81f8321680"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaSplitReader::into_data_event_stream (cyclomatic 27): KafkaSplitReader::into_data_event_stream 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":"src/connector/src/source/kafka/source/reader.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6b4105ad94fb4763fd76716aa05d2933e9b37fec7f6f03e9b4fbd1544140c4"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::encoder::bson::datum_to_bson (cyclomatic 27): risingwave_connector::sink::encoder::bson::datum_to_bson 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":"src/connector/src/sink/encoder/bson.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fed9a46506263cf8e94315f6588903d17974e446fc5df72c1053ce940eb633"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::plan_iceberg_table (cyclomatic 27): Planner::plan_iceberg_table 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":"src/frontend/src/planner/relation.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45c429267e68d2e83acf643a360f911f5cd989ca71f309a065982f195de239f"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::iceberg_compaction::memory::estimate_plan_memory (cyclomatic 27): risingwave_storage::hummock::compactor::iceberg_compaction::memory::estimate_plan_memory 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":"src/storage/src/hummock/compactor/iceberg_compaction/memory.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad33e37e54ab28b502ad9bdfd9af350d9737dd85eaae5f3e55f14f766352cde"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::execute (cyclomatic 27): Inner::execute 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":"src/stream/src/executor/project/project_scalar.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f4d2ac1678c030fce77ea28e6c92a1db28c7272cc3293d85c66a4abd90698c"}},{"ruleId":"D1","level":"warning","message":{"text":"PgProtocol::do_process_inner (cyclomatic 27): PgProtocol::do_process_inner 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":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a51bde16f4e06e980fb6e3070e327642beda7a9358370abc016df6c1d9098fc"}},{"ruleId":"D1","level":"warning","message":{"text":"HashAggExecutor::do_execute (cyclomatic 26): HashAggExecutor::do_execute has cyclomatic complexity 26 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"235d30b1c2f039de21da7f2a68d2c10d37335b671b1c811cd4948ce98e04cf44"}},{"ruleId":"D1","level":"warning","message":{"text":"SpecificParserConfig::new (cyclomatic 26): SpecificParserConfig::new 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":"src/connector/src/parser/config.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2067ae5761dbaea8004ecc7a59eaf2bf6d6ffb97c072b3bc8bcb5776277da4e7"}},{"ruleId":"D1","level":"warning","message":{"text":"RedisSink::validate (cyclomatic 26): RedisSink::validate 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":"src/connector/src/sink/redis.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cb44520180d3531aa64aa66f8a85bea9d3fac024ab48c5ee82252751be6474"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_user::handle_create_user (cyclomatic 26): risingwave_frontend::handler::create_user::handle_create_user 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":"src/frontend/src/handler/create_user.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9ef86f021ce2e0ecebfe56266a0ccacac15c716377e39509665a01a540b22f"}},{"ruleId":"D1","level":"warning","message":{"text":"NonOverlapSubLevelPicker::pick_sub_level (cyclomatic 26): NonOverlapSubLevelPicker::pick_sub_level 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":"src/meta/src/hummock/compaction/picker/non_overlap_sub_level_picker.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"31247ffc738359d3505786825c711607450dba5e9d62b4eaf0b561f21b8a4924"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_meta::controller::utils::check_relation_name_duplicate (cyclomatic 26): risingwave_meta::controller::utils::check_relation_name_duplicate 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":"src/meta/src/controller/utils.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"294e23659ae6f4f330f1831c59391f1decb5055b20dec08b3442b0ee161b947d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_optional_pattern_quantifier (cyclomatic 26): Parser::parse_optional_pattern_quantifier has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":6023}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d9c126959526110adb694ce7b69495d8c2abb5da3db2b9a150f3fa0cf2d7a1"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBackfillExecutor::execute_inner (cyclomatic 26): SnapshotBackfillExecutor::execute_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":"src/stream/src/executor/backfill/snapshot_backfill/executor.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc8a74bba6e521fe2118dd9893df6cd2b20b01b9e03999fbe3478c2284054d2"}},{"ruleId":"D1","level":"warning","message":{"text":"GapFillExecutor::generate_filled_rows_between_static (cyclomatic 26): GapFillExecutor::generate_filled_rows_between_static 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":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d748f63415d04cb9dea68c7be08169eaa7600a224c119d0cd826c07162fef47"}},{"ruleId":"D1","level":"warning","message":{"text":"GapFillExecutor::execute_inner (cyclomatic 26): GapFillExecutor::execute_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":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bb8647bdc62650e43de53893e19cfe9e25da5a8315fe32539812d56031b846"}},{"ruleId":"D1","level":"warning","message":{"text":"OverPartition::find_affected_ranges_readonly (cyclomatic 26): OverPartition::find_affected_ranges_readonly 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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe4310839bbaf861e6378cf51207c8b7dba8cf3c9434bdff3cba679cd5f90c9"}},{"ruleId":"D1","level":"warning","message":{"text":"SinkExecutor::process_msg (cyclomatic 26): SinkExecutor::process_msg 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":"src/stream/src/executor/sink.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"151ba22d508da69d02c190018422272e3eb311746a72fa17513425115c71b5f7"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.split_top_args (cyclomatic 26): extract.split_top_args 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":"docs/metrics/extract.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4e30242b30dce239a081aa0c523e0d426b12536040dab15bf71d9a05ec3f66"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceStreamChunkRowWriter::do_action (cyclomatic 25): SourceStreamChunkRowWriter::do_action 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":"src/connector/src/parser/chunk_builder.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba95cf42e355df4a436b7949b8d655f92ee39702fc7f84746f2162f15114486d"}},{"ruleId":"D1","level":"warning","message":{"text":"WaitCheckpointTask::run_with_on_commit_success (cyclomatic 25): WaitCheckpointTask::run_with_on_commit_success has cyclomatic complexity 25 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/connector/src/source/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be705010ae12e1bef5f8906769858cdb0582584af002a6f870c2e23460bf0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::parser::mysql::mysql_datum_to_rw_datum (cyclomatic 25): risingwave_connector::parser::mysql::mysql_datum_to_rw_datum 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":"src/connector/src/parser/mysql.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94f88f592fe8e4cb6945cda74b85d873e2df33aa3e29bc8c189645e1ea9531b"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_gap_fill (cyclomatic 25): Binder::bind_gap_fill 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":"src/frontend/src/binder/relation/gap_fill.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0546960a0887a24551aecc02ed7e48a236841de3d6039255f90dca60ac58b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_catalog_relation_by_name (cyclomatic 25): Binder::bind_catalog_relation_by_name 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":"src/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d947c367c3f8246288dcc10a5e5c432d2e39e839165f4f72fae161e72015243e"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::alter_owner::handle_alter_owner (cyclomatic 25): risingwave_frontend::handler::alter_owner::handle_alter_owner 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":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4625798f57f86b229861071a08e558156800f1ee3c44656ee2ca3dff4fa635d"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::validate::validate_compatibility (cyclomatic 25): risingwave_frontend::handler::create_source::validate::validate_compatibility 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":"src/frontend/src/handler/create_source/validate.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05cb3d2814d3e964bd24a7db149d85e0bf1db3b77b6fe999fbd173a5e00343d"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::bind_source_pk (cyclomatic 25): risingwave_frontend::handler::create_source::bind_source_pk 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":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f04730a26c254db016d917ee2f0ef4308d71d8ec0555414ec5da9aa6217f2d2"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::create_job_catalog (cyclomatic 25): CatalogController::create_job_catalog 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"01640e414a70dea82b3fc61f53d9e8c751b9592ed4ef5ccf90e7dedcc3c4b0a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_show (cyclomatic 25): Parser::parse_show 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. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":5244}}}],"partialFingerprints":{"codehealthFindingId/v1":"672a4fa010c0fcc9ed846a2055ca91584ff32d471dc61eceb777d0b6c810bc85"}},{"ruleId":"D1","level":"warning","message":{"text":"Decimal::mul (cyclomatic 24): Decimal::mul 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":"src/common/src/types/decimal.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2994f892b5234d757a134834f4aceedc60cad031f2e98ac9e49e7e4e57b01f99"}},{"ruleId":"D1","level":"warning","message":{"text":"CoordinatedLogSinker::consume_log_and_sink (cyclomatic 24): CoordinatedLogSinker::consume_log_and_sink has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/coordinate.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f4f885577084935c662f7481e10eaf18f57f482d18a7e9da15009b9b706ba"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergConfig::from_btreemap (cyclomatic 24): IcebergConfig::from_btreemap 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":"src/connector/src/sink/iceberg/config.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b486b9a75ae253e2fe64ce4be475c663fca6af933cbbe3e73aa1a4a8a04f8575"}},{"ruleId":"D1","level":"warning","message":{"text":"Unit::from_str (cyclomatic 24): Unit::from_str 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":"src/expr/impl/src/scalar/extract.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40ca5a76ccc15e8e1c18e62f34dbcebf1145f2c635c48e6351be390e88edd7a"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::bind_all_columns (cyclomatic 24): risingwave_frontend::handler::create_source::bind_all_columns has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2162e5f70c0472be2612bfb29ec5150dfceb266991c9e83a98e131a13870ea0"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockManager::truncate_time_travel_metadata (cyclomatic 24): HummockManager::truncate_time_travel_metadata 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":"src/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b7cc0fd912a7c0dde4fc076ec4eb15832ce044c8e8a8edb5ad99254268b8cc"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_meta::dashboard::handlers::get_streaming_stats_from_prometheus (cyclomatic 24): risingwave_meta::dashboard::handlers::get_streaming_stats_from_prometheus has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/dashboard/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f931c3331f28a52763eab8197ba12882feff7a67d9025990694ed6b547eaff5"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer::unescape_c_style (cyclomatic 24): Tokenizer::unescape_c_style has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 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. This is NOT this file\u0027s highest cyclomatic complexity: Token::fmt (cyclomatic 38) 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":"src/sqlparser/src/tokenizer.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a11db7994a405d72235fc3d1f9836871bba8294b1cbe2fcf1ac57a5e37c2933"}},{"ruleId":"D1","level":"warning","message":{"text":"AsOfJoinExecutor::eq_join_left (cyclomatic 24): AsOfJoinExecutor::eq_join_left has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3041455e34d71e962fb4767abb500d9fa002940f5c155c5c1dbf43d50a4c373"}},{"ruleId":"D1","level":"warning","message":{"text":"NowExecutor::execute_inner (cyclomatic 24): NowExecutor::execute_inner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/now.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ada671f8f8a4b9910cd9808aec1123b29175fee1bcf5fd7a6ebc6f927925b6"}},{"ruleId":"D1","level":"warning","message":{"text":"PartitionCache::shrink (cyclomatic 24): PartitionCache::shrink has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/range_cache.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"554291a38b159e21c4581302f6bd82ab483d62b60588005fe1e469ad8b86d536"}},{"ruleId":"D1","level":"warning","message":{"text":"RelationGraph.RelationGraph (cyclomatic 24): RelationGraph.RelationGraph has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 255, 283, 206, \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":"dashboard/components/RelationGraph.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d3507c31322ced634883803ff3bc04a0eed413f4282f21bfd38e602f4a74e"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::webhook::websocket::try_handle_connection (cyclomatic 23): risingwave_frontend::webhook::websocket::try_handle_connection 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":"src/frontend/src/webhook/websocket.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e011d051e082612b90ced7447413b8bbed8958f3072cd80740a37231667bdf"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::external_schema::bind_columns_from_source_for_non_cdc (cyclomatic 23): risingwave_frontend::handler::create_source::external_schema::bind_columns_from_source_for_non_cdc has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/frontend/src/handler/create_source/external_schema.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a4649da1a8f730af8169db424c54926e4a8d293d3a912f936a26585968eba4"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::finish_replace_streaming_job_inner (cyclomatic 23): CatalogController::finish_replace_streaming_job_inner has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b63c43952b1eee66ef720a5fad9ac0adf377d146b14a41d8905c0ae9bef64e"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::update_connection_and_dependent_objects_props (cyclomatic 23): CatalogController::update_connection_and_dependent_objects_props 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":3280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4458cee5c258fd1797b820087c67668bc5567c9b73f335fba47458d8fac87b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockManager::commit_epoch (cyclomatic 23): HummockManager::commit_epoch 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":"src/meta/src/hummock/manager/commit_epoch.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4923bab21bc34a9639d025a82d2c743066e7e519199cda0449820a62922dff"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildingFragment::fill_job (cyclomatic 23): BuildingFragment::fill_job 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":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c85658bd6b9e477208c63deec10a20fea854a9bdf9b478079d1eda1d016252f"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_alter_sink (cyclomatic 23): Parser::parse_alter_sink 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: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7b8b5dc21bf0c550443a7c8dc40b4f731ff7b79d62d7ad86b322c7b9fb2718"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_grant_revoke_privileges_objects (cyclomatic 23): Parser::parse_grant_revoke_privileges_objects 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: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":6182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee82b44bbe3a00243a99da595d49a283dde59ba5215998c9f21a4f93967bcc3"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockVersionCommon::build_sst_delta_infos (cyclomatic 23): HummockVersionCommon::build_sst_delta_infos 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":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc89db40e4c2be8bc20645bc5ab815515dddb7ba2f0f739c13a0431f78659e22"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::compactor_runner::compact_and_build_sst (cyclomatic 23): risingwave_storage::hummock::compactor::compactor_runner::compact_and_build_sst 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":"src/storage/src/hummock/compactor/compactor_runner.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fee58cc3e0b17ac36215ce1461ebe7418ec5f68ac0e03b76624e352cfa0aa18"}},{"ruleId":"D1","level":"warning","message":{"text":"DynamicFilterExecutor::execute_inner (cyclomatic 23): DynamicFilterExecutor::execute_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":"src/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"36da921ac9b2fb9d51c220ef709088f606c40fcc192000c8fd60b2550b110b47"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchOpendalFsFetchExecutor::into_stream (cyclomatic 23): BatchOpendalFsFetchExecutor::into_stream 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":"src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9bb40c81e01dd4731005a5c1cfa213dcd237b1c88544c611e6ef43b5598be7"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchPosixFsFetchExecutor::into_stream (cyclomatic 23): BatchPosixFsFetchExecutor::into_stream 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":"src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4a8df7bd0076e5b0296c100daba4416c36e4f9a25f3a0cb673fcf25ebcdeaf"}},{"ruleId":"D1","level":"warning","message":{"text":"FsFetchExecutor::into_stream (cyclomatic 23): FsFetchExecutor::into_stream 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":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a286b30d518c91ca56b630c6524ae8b3571f8d0886c7bc17c9362769e18b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_stream::executor::barrier_align::barrier_align (cyclomatic 23): risingwave_stream::executor::barrier_align::barrier_align 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":"src/stream/src/executor/barrier_align.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3d4315ba6295700582777d47758440b618e36f6fb85ef38677dea90e116bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_stream::executor::temporal_join::phase1::handle_chunk (cyclomatic 23): risingwave_stream::executor::temporal_join::phase1::handle_chunk 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":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"580463a04ee2b86b74a84fd8de5d4bb1e9410e2efb4508ca2ae7f8d460cbb73b"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultCache::consume (cyclomatic 23): ResultCache::consume 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":"src/utils/pgwire/src/pg_extended.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c835f3b0c3a55efaf45923ab167a7ea91a0ffa81b9f862cd5bbdaf83d5aca5"}},{"ruleId":"D1","level":"warning","message":{"text":"fragment_graph.Streaming (cyclomatic 23): fragment_graph.Streaming has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 299, 317, 262, \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":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1efe2bfad5a18c916ebd36240f084e5f2d319c031d2749699f75805d1fab85"}},{"ruleId":"D1","level":"warning","message":{"text":"LookupJoinBase::do_execute (cyclomatic 22): LookupJoinBase::do_execute has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/lookup_join_base.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6f9be1c329a0d9ff1ba546d9f10063a0414df9947168e4b7874ac7d75c25b2"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common::vnode_mapping::vnode_placement::place_vnode (cyclomatic 22): risingwave_common::vnode_mapping::vnode_placement::place_vnode 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/common/src/vnode_mapping/vnode_placement.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b09fb5f25260d603444a2012cdc6c064964d9fc79ef5b0a0ca0cfb002f7a7d3"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector_codec::decoder::protobuf::parser::from_protobuf_value (cyclomatic 22): risingwave_connector_codec::decoder::protobuf::parser::from_protobuf_value has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/codec/src/decoder/protobuf/parser.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3131a021e0740a96ebecd78d0cd9108d5d36d25908657183659195b94688e88b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarAdapter::into_scalar (cyclomatic 22): ScalarAdapter::into_scalar 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":"src/connector/src/parser/scalar_adapter.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"59790a90fa7f1c68b4d64527c4f910e9a541117ec12ed409ce4b06117856c409"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::parser::parse_message_stream (cyclomatic 22): risingwave_connector::parser::parse_message_stream 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/connector/src/parser/mod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"82690347f4d173c1a35ac650e2a70895b68a5a084ae6314106426c85e90173fe"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_expr::scalar::like::like_impl (cyclomatic 22): risingwave_expr::scalar::like::like_impl 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/expr/core/src/scalar/like.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c2d958e40b508a88f4bdb22aff5c4828de770645ced4bda9255f436486b523"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_insert (cyclomatic 22): Binder::bind_insert 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/frontend/src/binder/insert.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2505db793113fa7d435ae70ae7972dbe9148389751e80cb99f38f3d5f0577205"}},{"ruleId":"D1","level":"warning","message":{"text":"BooleanConstantFolding::rewrite_function_call (cyclomatic 22): BooleanConstantFolding::rewrite_function_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":"src/frontend/src/expr/utils.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c48d8d07fa4f7eabac1af362f53ed7d32d620a9c089a5b838746dfecc132e6"}},{"ruleId":"D1","level":"warning","message":{"text":"PullUpHopRule::apply (cyclomatic 22): PullUpHopRule::apply 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":"src/frontend/src/optimizer/rule/pull_up_hop_rule.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84733c960c5d8e4648a550ac4f8a429263f7fc146197e94a96b388be5eb2fa4"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::optimizer::plan_node::stream_hash_join::derive_watermark_for_hash_join (cyclomatic 22): risingwave_frontend::optimizer::plan_node::stream_hash_join::derive_watermark_for_hash_join has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_hash_join.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb007d8eb2ffc74a556bd286fe3f3d8d16e0a96848869a638b26c6b689cfb86"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::alter_table_column::handle_alter_table_column (cyclomatic 22): risingwave_frontend::handler::alter_table_column::handle_alter_table_column 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/frontend/src/handler/alter_table_column.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b808cabea51b785229482bfdb7cd2600bdb3021f6eeeb470662c21fdb6ea0d69"}},{"ruleId":"D1","level":"warning","message":{"text":"PostCollectCommand::post_collect (cyclomatic 22): PostCollectCommand::post_collect has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/context/context_impl.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f11bf8c829242ba1f0c414f3aeeacc656b25f1960bc42a7c29f18920bfd63ab"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockManager::merge_compaction_group_impl (cyclomatic 22): HummockManager::merge_compaction_group_impl has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_group_schedule/topology.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"94587accd61bdb096485fd14419eb2412e50d58913ffebebfeaba113f6221041"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::schedule (cyclomatic 22): Scheduler::schedule 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/meta/src/stream/stream_graph/schedule.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b7cfa940a794c4442cd0a934cf477cc5db0eac9e8419db92fab0aa0498f057"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_alter_source (cyclomatic 22): Parser::parse_alter_source has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ea1a541ce240194247565a554ca7fc2ac31d0aa8a18b6f911677727743d8af"}},{"ruleId":"D1","level":"warning","message":{"text":"HopWindowExecutor::execute_inner (cyclomatic 22): HopWindowExecutor::execute_inner 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/stream/src/executor/hop_window.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bf426bae009c4db5b0bb04825ef282d4e8a6ded898cc52721e9909d3374cd1"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchRecognizeExecutor::execute_inner (cyclomatic 22): MatchRecognizeExecutor::execute_inner 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/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d92113225f72953d65689374034180d06ec9a8c71375f00718287ce9e99de03"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.find_matching_paren (cyclomatic 22): extract.find_matching_paren 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":"docs/metrics/extract.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaac5a7c4f3f3c8490c89cde7e84d5ca1e5b25f4379136290be55f6aa58b27c"}},{"ruleId":"D1","level":"warning","message":{"text":"heap_profiling.HeapProfiling (cyclomatic 22): heap_profiling.HeapProfiling 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 4 function literals inside it that branch (lines 93, 87, 130, \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":"dashboard/pages/heap_profiling.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"df461143b24b3200e47bfb6ff7c6999b7f3f203f5ccd8f880bb936ebe991dae6"}},{"ruleId":"D1","level":"warning","message":{"text":"DataChunk::from_pretty (cyclomatic 21): DataChunk::from_pretty has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (parse_type). 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":"src/common/src/array/data_chunk.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"f353e59f9971d19ddfed215e36d936f497519cf79d942ab8fab06e5f21b5bd38"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::iceberg::create_table::create_table_if_not_exists_impl (cyclomatic 21): risingwave_connector::sink::iceberg::create_table::create_table_if_not_exists_impl 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":"src/connector/src/sink/iceberg/create_table.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff2b2c6879cb7d6432c9a81a00b3a755c512848d5b355f80764dd37ffdf858b"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::alter_owner (cyclomatic 21): CatalogController::alter_owner 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":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3774ba02bdd9c65eae84692d934e49a6daee6a82d40efaf7b25717290b87a7a"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockVersionReader::get (cyclomatic 21): HummockVersionReader::get 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":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d868e51a6947eea30497c3bdb52096322a1c7a713d6e2037335b19e2f3493007"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockVersionReader::iter_inner (cyclomatic 21): HummockVersionReader::iter_inner 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":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"eace13591707839f41b15497e2e4ee6ae7e5d3a258f4600788cd789a1c89279f"}},{"ruleId":"D1","level":"warning","message":{"text":"Decimal::div (cyclomatic 20): Decimal::div 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":"src/common/src/types/decimal.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e757f00b32f1ad263c5c6ee7c9e0f678ec0d5ef8445851f5484e89f4ef6037"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanRange::range_overlap_check (cyclomatic 20): ScanRange::range_overlap_check 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":"src/common/src/util/scan_range.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20e98a583341d698594f2b4dd2eb663fecdecfe5982ee666b75654871e8afe7"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common::types::variant::parse_path (cyclomatic 20): risingwave_common::types::variant::parse_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. This is NOT this file\u0027s highest cyclomatic complexity: risingwave_common::types::variant::append_datum_value (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":"src/common/src/types/variant.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"56efca282b2399ce12a529d23f1d4a533917da7a56b4dd7638d1f1c3762a8356"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExternalTableReader::snapshot_read_inner (cyclomatic 20): MySqlExternalTableReader::snapshot_read_inner 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: risingwave_connector::source::cdc::external::mysql::type_name_to_mysql_type (cyclomatic 49) 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":"src/connector/src/source/cdc/external/mysql.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6ac62ee9699e4f41cfc58292a225c7af18dc11c8382cb07d56d49b9803110a"}},{"ruleId":"D1","level":"warning","message":{"text":"NatsPropertiesConsumer::set_config (cyclomatic 20): NatsPropertiesConsumer::set_config 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":"src/connector/src/source/nats/mod.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"162a6a6e996b8d6e4ecd4b457af67a5a2fb13994703db42ff401c6a857d4bbc8"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_expr_impl::scalar::regexp::regexp_replace (cyclomatic 20): risingwave_expr_impl::scalar::regexp::regexp_replace 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":"src/expr/impl/src/scalar/regexp.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aab052b97fa69b7f89167d021c66245c4baa32b4b720b1023610979253f21c2"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergIntermediateScanRule::apply (cyclomatic 20): IcebergIntermediateScanRule::apply 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":"src/frontend/src/optimizer/rule/iceberg_intermediate_scan_rule.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2852ea6fab58342ad4813f2325da0cc2f52817f0a77e75bc78d9b5723394cd"}},{"ruleId":"D1","level":"warning","message":{"text":"StageRunner::schedule_tasks (cyclomatic 20): StageRunner::schedule_tasks 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":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b209acc1d8efb96185f60affd4a62f2a0aa85a7bfc49f1e5cd27c965dffda4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Condition::split_row_cmp_to_scan_ranges (cyclomatic 20): Condition::split_row_cmp_to_scan_ranges 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df6d57bf87e36b34add38ce2fa80f2f6a2515916d7e0ea92edaeb06c5eb50ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Condition::split_to_scan_ranges (cyclomatic 20): Condition::split_to_scan_ranges 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc80c1c5c81de1e8ed79754b40376b5d23641a7af948a5a0e14b0e72209317b"}},{"ruleId":"D1","level":"warning","message":{"text":"DdlServiceImpl::auto_schema_change (cyclomatic 20): DdlServiceImpl::auto_schema_change 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":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0065218cec25d00940948dc2b889f456aa3664d74bde4e44c0a0853b71b133"}},{"ruleId":"D1","level":"warning","message":{"text":"InflightDatabaseInfo::apply_collected_command (cyclomatic 20): InflightDatabaseInfo::apply_collected_command 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":"src/meta/src/barrier/info.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e7845fb46c50ea8669a5b5cb821621536c95d5b45417a91c22299be0c5a1f0"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialGraphManager::next_event_inner (cyclomatic 20): PartialGraphManager::next_event_inner 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":"src/meta/src/barrier/partial_graph.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3e8d9835db9570dc2b09903e53734472f9e9890dc08c6130e313921f50d5c3"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::update_fragment_rate_limit_by_fragment_id (cyclomatic 20): CatalogController::update_fragment_rate_limit_by_fragment_id 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b6522e1f0e2034ea23a92d9bcf0df30b9541f9218750bd36b0337d8c811924"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergCompactionManager::apply_sink_update (cyclomatic 20): IcebergCompactionManager::apply_sink_update 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":"src/meta/src/manager/iceberg_compaction/schedule.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4c770e9d1652b39f0d39f31fa168e28ca01b652fbe2b6afba0e0f02ac26f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"CoordinatorWorker::run_coordination (cyclomatic 20): CoordinatorWorker::run_coordination 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":"src/meta/src/manager/sink_coordination/coordinator_worker.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b51829c7c63fd48a0acc650eaf8e193d04b5309ea61c4a3f0f9e4134e2aadf"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceManagerCore::apply_source_change (cyclomatic 20): SourceManagerCore::apply_source_change 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":"src/meta/src/stream/source_manager.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1640e49fc3ea8c2a00af0d2ebc795343a28f0c105a996adc5f9389c41dd06690"}},{"ruleId":"D1","level":"warning","message":{"text":"UserOptions::parse_to (cyclomatic 20): UserOptions::parse_to 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":"src/sqlparser/src/ast/statement.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b870974bb10bc15578b2cf884aa942df7c23d6b7fab7e76ea17493e1677d6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"UpstreamTableExecutor::into_stream (cyclomatic 20): UpstreamTableExecutor::into_stream 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":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/executor.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef285e387f3e24a3272170951ee547157c83aa1672274f2722dde9d601e42e5e"}},{"ruleId":"D1","level":"warning","message":{"text":"HashJoinExecutor::handle_match_rows (cyclomatic 20): HashJoinExecutor::handle_match_rows 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":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6335ba6f2837f18bded09880f459c10e9a3b4c3c54ad989cfff80da67419b6"}},{"ruleId":"D1","level":"warning","message":{"text":"SinkExecutor::execute_consume_log (cyclomatic 20): SinkExecutor::execute_consume_log 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":"src/stream/src/executor/sink.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"46469328d4914f05926da3acaad1fab286d5d7ba4a87a878eb4399167a7bd69a"}},{"ruleId":"D1","level":"warning","message":{"text":"TemporalJoinExecutor::into_stream (cyclomatic 20): TemporalJoinExecutor::into_stream 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":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be036d4dd7570436d2ce81530e2e5199f76827bedb879dd4641b60b6d86797b"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_stream::executor::lookup::sides::align_barrier (cyclomatic 20): risingwave_stream::executor::lookup::sides::align_barrier 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":"src/stream/src/executor/lookup/sides.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8969c1dfbbe3bd38ad030d6a426f2c6c9cd1de6f55473ddc34f8c0760ebdd7f"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_stream::executor::lookup::sides::stream_lookup_arrange_this_epoch (cyclomatic 20): risingwave_stream::executor::lookup::sides::stream_lookup_arrange_this_epoch 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":"src/stream/src/executor/lookup/sides.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc85a7a7780e8a6cb1457c2a7301a4d1c490b6ae48fde37c916e61f2561d75ec"}},{"ruleId":"D1","level":"warning","message":{"text":"cpu_profiling.CpuProfiling (cyclomatic 20): cpu_profiling.CpuProfiling has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to 4 function literals 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":"dashboard/pages/cpu_profiling.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed347b8299445130a9e200876d972694a2622c1bd94c6873ad5f303971c8e6"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common::system_param::check_missing_params (cyclomatic 19): risingwave_common::system_param::check_missing_params 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 shape REPEATS in the file: one other method here (risingwave_common::system_param::validate_init_system_params) 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. This is NOT this file\u0027s highest cyclomatic complexity: risingwave_common::system_param::system_params_from_kv (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":"src/common/src/system_param/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce694ec7116d74e5aea5fd70797194aaaba0247a3d9d57757aa695ef0162df2"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common::system_param::validate_init_system_params (cyclomatic 19): risingwave_common::system_param::validate_init_system_params 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 shape REPEATS in the file: one other method here (risingwave_common::system_param::check_missing_params) 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. This is NOT this file\u0027s highest cyclomatic complexity: risingwave_common::system_param::system_params_from_kv (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":"src/common/src/system_param/mod.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"07236e5f182c38af6d9d7405144c1b9d822b3a24f898a9de58f65afb4aaf9a24"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::http::validate_http_sink (cyclomatic 19): risingwave_connector::sink::http::validate_http_sink 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/connector/src/sink/http.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a812f4e5ef85538a4a94b75c4c9533412c2da2f4bac1523f3e79659f292f43fa"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::meta::reschedule::unregister_workers (cyclomatic 19): risingwave_ctl::cmd_impl::meta::reschedule::unregister_workers 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/ctl/src/cmd_impl/meta/reschedule.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ab654436238a7c56b3ea7af2503e32fb1e95a2464c1cb5f4e676bb3faec3e0"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionAttr::parse (cyclomatic 19): FunctionAttr::parse 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":"src/expr/macro/src/parse.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cf0cb9c27df674cd82f9e5a0809bfb58cfd6189747c74f87c8bde6e8b33845"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_update (cyclomatic 19): Binder::bind_update 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/frontend/src/binder/update.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"16181d15e00af9fcd839e1f553fc1179765164951e9c36397c8ad1795e45b412"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_function::handle_create_function (cyclomatic 19): risingwave_frontend::handler::create_function::handle_create_function 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/frontend/src/handler/create_function.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"50501acb55ea9d2264a4dcc9af08ef7c241ea59dcc358a7508b4ca74be41c728"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialGraphRecoverer::inject_database_initial_barrier (cyclomatic 19): PartialGraphRecoverer::inject_database_initial_barrier has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/meta/src/barrier/rpc.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3e5f4ba7bae7aed982c8b06671d8f709f1e930a9681f70e7b2f866fceffd0f"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::try_abort_creating_streaming_job (cyclomatic 19): CatalogController::try_abort_creating_streaming_job 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"635b0666f4f0d9c620a0bc3bb52a66f02ae11b113a3b15674a497827cdddee21"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryRewriter::visit_expr (cyclomatic 19): QueryRewriter::visit_expr has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/rename.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aee4e35b7adaca07d5c743ca11224709f288c919a1ba9e6fb27f824570473e"}},{"ruleId":"D1","level":"warning","message":{"text":"SpaceReclaimCompactionPicker::pick_compaction (cyclomatic 19): SpaceReclaimCompactionPicker::pick_compaction 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/meta/src/hummock/compaction/picker/space_reclaim_compaction_picker.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"126aa1195ff81dff80ec0b7be404e194012a04bbafa6ce2499121964c10bcc8b"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockManager::get_compact_tasks_impl (cyclomatic 19): HummockManager::get_compact_tasks_impl 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/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"df62e8c094d86690c0696b1f4b3aa8a3f9b5bbcfb990a805d7cf9010774dfa0b"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockManager::report_compact_tasks_impl (cyclomatic 19): HummockManager::report_compact_tasks_impl 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/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb457e054ccce9da7e584e56c76172341bb0bd320d5e715d363109468b42ff16"}},{"ruleId":"D1","level":"warning","message":{"text":"Matches::try_match (cyclomatic 19): Matches::try_match 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/meta/src/stream/stream_graph/state_match.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3831fff1e08322f43ff79164c0562b63b1a8943800a10a0a37217cf208f33b21"}},{"ruleId":"D1","level":"warning","message":{"text":"TableFactor::fmt (cyclomatic 19): TableFactor::fmt 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/sqlparser/src/ast/query.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"234d2a36b92f664af090e027aa886cbc539501cc74609c9ab9c9ff53239049d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_create (cyclomatic 19): Parser::parse_create 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: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83b1567f53e2bf7013c303bfeb5a7321d8c88c630b2bffac775649db9f436c6"}},{"ruleId":"D1","level":"warning","message":{"text":"SstableBuilder::add_impl (cyclomatic 19): SstableBuilder::add_impl 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/storage/src/hummock/sstable/builder.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df543cc97a1b0b9f2f5abb9322f95aab30c0c3e51370fd31d006f034230a84"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::start_shared_compactor (cyclomatic 19): risingwave_storage::hummock::compactor::start_shared_compactor 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/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ee623da12dabe38210687cc38792a9cf59ecb6711b795b6498b669a712c99d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConsumeUpstreamStream::poll_next (cyclomatic 19): ConsumeUpstreamStream::poll_next 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":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8049d9cd419a0a599c7bc5579907bcf6d5eada57008ecc56b19040f45421a3"}},{"ruleId":"D1","level":"warning","message":{"text":"OverPartition::build_changes (cyclomatic 19): OverPartition::build_changes 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/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f45623d29805232c884197e902d79ba391823bf62dbc1bc015a3d75a229e099"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::execute (cyclomatic 19): Inner::execute has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/project/materialized_exprs.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd16eb63cc39fceb297ece49c516189aa04c05f6ea0de502170d5596c1b2b31"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergFetchExecutor::into_stream (cyclomatic 19): IcebergFetchExecutor::into_stream 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/stream/src/executor/source/iceberg_fetch_executor.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a29b8c656387562cb0e8803b52f1e563df9378738b92cf8e1aca19287fe94f"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_rt::logger::init_risingwave_logger (cyclomatic 19): risingwave_rt::logger::init_risingwave_logger 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/utils/runtime/src/logger.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c65ecf3160fc544765b028783c817bd4168e8a76f033ce5af8f792617ca663"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.scan_direct_constructions (cyclomatic 19): extract.scan_direct_constructions 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":"docs/metrics/extract.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9d38eccf7f78c0096815acd3c32c2d365e2739319666d727ec6b001df6328a"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.main (cyclomatic 19): extract.main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"671bb0eff161d15e2eb3e19d38416b3d152cfae66f68969ed198aa070d7423ad"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatError::check_expr (cyclomatic 18): FormatError::check_expr has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lints/src/format_error.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d4eed44bc29f704c64f08b070492a951e144b19f9f819c54723fa3986f3c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"SortExecutor::do_execute (cyclomatic 18): SortExecutor::do_execute has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/order_by.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"74328880cb33134448544e8e5bc5fc32b0d59fc6c97b23461a74c49fbcbfda7a"}},{"ruleId":"D1","level":"warning","message":{"text":"StackTraceResponseOutput::fmt (cyclomatic 18): StackTraceResponseOutput::fmt has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/prost.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d589a82a6b9bad005dfaaea6791320e7287def9e762c63c1e2ec8b760a36cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarAdapter::from_scalar (cyclomatic 18): ScalarAdapter::from_scalar 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":"src/connector/src/parser/scalar_adapter.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfd1b0625006027749d65ff000180f3de515d0d1c8e01d6c323034e2b94a38c"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCase::run_sql (cyclomatic 18): TestCase::run_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":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"918ebe8f5d77c5f14a0754b44ee93e8f54b59bffdb25c1e8efc872f629841549"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_column (cyclomatic 18): Binder::bind_column 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":"src/frontend/src/binder/expr/column.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1561def8f51fc20c4e271642bf774d55b97c1875579ca55ce8de271dee749481"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaJoinSolver::find_lookup_path (cyclomatic 18): DeltaJoinSolver::find_lookup_path has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/frontend/src/optimizer/delta_join_solver.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bac7b19186b66333ee07962f0c003cacad4941634aa5286de9932282401696c"}},{"ruleId":"D1","level":"warning","message":{"text":"Agg::infer_stream_agg_state (cyclomatic 18): Agg::infer_stream_agg_state 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":"src/frontend/src/optimizer/plan_node/generic/agg.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"045ab786c04c4161cdfacbe244994ed926695923c33adb78e024a853dbda5913"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalMultiJoin::as_bushy_tree_join (cyclomatic 18): LogicalMultiJoin::as_bushy_tree_join has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea10085d6f6704f0c3d032666eddf42dc90953fdb9f47cb0185099841e90e39"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexDeltaJoinRule::apply (cyclomatic 18): IndexDeltaJoinRule::apply 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 2 function items inside it that branch (match_indexes, match_through_exchange). 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":"src/frontend/src/optimizer/rule/index_delta_join_rule.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed74966738e970d078e321e04e69836ab4eeadc28ffdd3a61d7433502b2552a3"}},{"ruleId":"D1","level":"warning","message":{"text":"PullUpCorrelatedPredicateAggRule::apply (cyclomatic 18): PullUpCorrelatedPredicateAggRule::apply 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":"src/frontend/src/optimizer/rule/pull_up_correlated_predicate_agg_rule.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88619851e3ca794e5d6797a1a2765afbd7842b3f11875533377f4746e847e56"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::optimizer::rule::over_window_to_topn_rule::handle_rank_preds (cyclomatic 18): risingwave_frontend::optimizer::rule::over_window_to_topn_rule::handle_rank_preds has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/over_window_to_topn_rule.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"63db03075a99940e3eca65f6e0972a69220fbd8b30e14024766c29b4e8cf172c"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::alter_set_schema::handle_alter_set_schema (cyclomatic 18): risingwave_frontend::handler::alter_set_schema::handle_alter_set_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":"src/frontend/src/handler/alter_set_schema.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a243a9cd35fad205e3ea5cf59da30c6e0e862902d4fb9e22473da0faa79db"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::utils::iceberg_predicate::rw_expr_to_iceberg_predicate (cyclomatic 18): risingwave_frontend::utils::iceberg_predicate::rw_expr_to_iceberg_predicate 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":"src/frontend/src/utils/iceberg_predicate.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"79509aaf6ef78f9ea69eb2021baa767d1315d4788a4818a1032198172432edc7"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointControl::handle_new_barrier (cyclomatic 18): CheckpointControl::handle_new_barrier has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff01681e1a317830561405506f67350aeceedd7824191b81a6765edba7c68a9"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseCheckpointControl::handle_new_barrier (cyclomatic 18): DatabaseCheckpointControl::handle_new_barrier has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a0bff46631f15efe0d51097700265445353e045c2c46d7bc12275bef77c583"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockManager::split_compaction_group_impl (cyclomatic 18): HummockManager::split_compaction_group_impl 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":"src/meta/src/hummock/manager/compaction/compaction_group_schedule/topology.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c04ad4331a28c869e25c6d7400732dca638b2ebaee01f1e6d53b4cd990b7371"}},{"ruleId":"D1","level":"warning","message":{"text":"DdlController::create_streaming_job (cyclomatic 18): DdlController::create_streaming_job 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: DdlController::run_command (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":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6d418d2e9901d240ffaec1d031457b080cf9fcc9222b3e100f83bd92e9ed7b"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalStreamManager::run (cyclomatic 18): GlobalStreamManager::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/scale.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bc270e6a0f0739a895c4b3bd2adceb46eb05b4ceee4a57c2e726bfa34ee955"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_meta::stream::stream_graph::state_match::match_graph (cyclomatic 18): risingwave_meta::stream::stream_graph::state_match::match_graph has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (dfs). 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":"src/meta/src/stream/stream_graph/state_match.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a968a3202eb39666b0cacfaec85356b37fa7c32b4dfc1e53f568177e7232f"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_alter (cyclomatic 18): Parser::parse_alter 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: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"530f361bedf81ad41495450212e5cd367574aebc6b4f8b6fd82a52cae9280a56"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactTaskExecutor::run (cyclomatic 18): CompactTaskExecutor::run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/fast_compactor_runner.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c0bc154736de99c446d366122332bc34950f1e34293ef2af39c1d302f8c028"}},{"ruleId":"D1","level":"warning","message":{"text":"SstableStore::prefetch_blocks (cyclomatic 18): SstableStore::prefetch_blocks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable_store.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e730f396cef3d33bdc396d199e9d082b9ffb5f3062ea35d8ddec9ad7bf95dc0c"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::compactor_runner::compact_with_agent (cyclomatic 18): risingwave_storage::hummock::compactor::compactor_runner::compact_with_agent 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":"src/storage/src/hummock/compactor/compactor_runner.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd80cb650847ae9105a2e12838555dda0aeafccf17a2346864d7bdc48dd0a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::build_task_planning_config (cyclomatic 18): risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::build_task_planning_config has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a6765363466c0bd03528f36015db2b899e5cefbe527f227a3eccc6b3e6667e"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::shared_buffer_compact::compact_shared_buffer (cyclomatic 18): risingwave_storage::hummock::compactor::shared_buffer_compact::compact_shared_buffer has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/shared_buffer_compact.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaa046af70604ef4ba3b3ec3c392058d77f1499fa37400c9fcc943e4e949de0"}},{"ruleId":"D1","level":"warning","message":{"text":"HashAggExecutor::execute_inner (cyclomatic 18): HashAggExecutor::execute_inner has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/aggregate/hash_agg.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6be91cc2794526f0695096b77be2aeda91cb99f8db11d59fe050fcdada9a313"}},{"ruleId":"D1","level":"warning","message":{"text":"SinkExecutor::execute_write_log (cyclomatic 18): SinkExecutor::execute_write_log has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/sink.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0adb9c7125ae18da7b3a31a100f883e169e348402a551ec720b77aa800fa5c"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchAdbcSnowflakeFetchExecutor::into_stream (cyclomatic 18): BatchAdbcSnowflakeFetchExecutor::into_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":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da87708beee5bd71499064706e0a564de0e598b29a410fdc8a14516fd5cf29d"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedTopNState::init_topn_cache_inner (cyclomatic 18): ManagedTopNState::init_topn_cache_inner has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/top_n_state.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daaa0beea56fe5c27e8e009f7a9a794b6a2b7f29fcda630a441a28f0ebbe503"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_issue_tracker.find_tracking_issues (cyclomatic 18): doc_issue_tracker.find_tracking_issues 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":".github/scripts/doc_issue_tracker.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"db67fc897c2f1c7358bfc67af2d533a12e5d3e6cb892b597d1606b0a040a33e7"}},{"ruleId":"D1","level":"warning","message":{"text":"streamingStats.createStreamingStatsRefresh (cyclomatic 18): streamingStats.createStreamingStatsRefresh 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 69, 104, 54). 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":"dashboard/lib/api/streamingStats.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaabd442907f14a3df91e44cf21d5b35c15190eafbb3e425e4c83e140b71ada"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_cmd_all::single_node::map_single_node_opts_to_standalone_opts (cyclomatic 17): risingwave_cmd_all::single_node::map_single_node_opts_to_standalone_opts 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":"src/cmd_all/src/single_node.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29eafbfd341af539560a3ae549fb61a920a9d7c6dde3521e7cee124898120c8"}},{"ruleId":"D1","level":"warning","message":{"text":"ObserverManager::wait_init_notification (cyclomatic 17): ObserverManager::wait_init_notification 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":"src/common/common_service/src/observer_manager.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb9bb649f77adab04a855dc7d307a7d69850ec5a50df82a4f555d573268c9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common_proc_macro::session_config::derive_config (cyclomatic 17): risingwave_common_proc_macro::session_config::derive_config 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/common/proc_macro/src/session_config.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb56e627a4b784b1ad07108bd99b97fb68d8044eb9e11e9e9471c0238778ecc9"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_common_proc_macro::derive_estimate_size (cyclomatic 17): risingwave_common_proc_macro::derive_estimate_size has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/proc_macro/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d24a41f1e042a8646e4d576b98fe7fa0ece7fa9db6c796ca5d4fae4324bc87"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateEncoder::build (cyclomatic 17): TemplateEncoder::build 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: SinkFormatterImpl::new (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":"src/connector/src/sink/formatter/mod.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"133ce9998a4af8b7b31ca14741af7d6505f1aba7ce4b41477487a0321009c94f"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteLogSinker::consume_log_and_sink (cyclomatic 17): RemoteLogSinker::consume_log_and_sink has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/remote.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde0d124e6f4251eb7d3e5d694b0afc155468f97b447f5c7d120dd04ef93d634"}},{"ruleId":"D1","level":"warning","message":{"text":"KinesisSplitReader::into_data_stream (cyclomatic 17): KinesisSplitReader::into_data_stream 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/connector/src/source/kinesis/source/reader.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf609e3a4a40df4574b765804b0dff8a49846827978fe645d66f295905a8627"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::parser::unified::debezium::extract_bson_id (cyclomatic 17): risingwave_connector::parser::unified::debezium::extract_bson_id 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7ce2bdca9980eb3168905ad44413aa7f6b8b0b6c8b3a6883e3ffae46da0fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::deltalake::check_field_type (cyclomatic 17): risingwave_connector::sink::deltalake::check_field_type 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":"src/connector/src/sink/deltalake.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aa2c6c5f4a0d7ddc31e1613e0bd07092a9c089655da4f74c1ec7c485925ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_window_function (cyclomatic 17): Binder::bind_window_function 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/frontend/src/binder/expr/function/window.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd70bdef732f611f074d20c152e8d3ac472b51c44a62a04cb6bf9b936227ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder::bind_join_constraint (cyclomatic 17): Binder::bind_join_constraint 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":"src/frontend/src/binder/relation/join.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"24efed04f18881f6929d0f9825f3008c304f994e269c804b620e4d65656a6c78"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyJoinTransposeRule::apply (cyclomatic 17): ApplyJoinTransposeRule::apply 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":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5854e099d20c39e36f2af07158dd30412191014d7467b3f351d846e8d23245b"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::catalog::purify::try_purify_table_source_create_sql_ast (cyclomatic 17): risingwave_frontend::catalog::purify::try_purify_table_source_create_sql_ast 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/frontend/src/catalog/purify.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3f02c229eeab0a9cb7327dbe60e44c07bf5f11b81e99894b11bdad9b3bffaf"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseCheckpointControl::next_complete_barrier_task (cyclomatic 17): DatabaseCheckpointControl::next_complete_barrier_task 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/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f97b614bf6a048beff0c36a1fa801538fbc2498a3c1617fc364b53a5afb757d"}},{"ruleId":"D1","level":"warning","message":{"text":"ClusterControllerInner::add_worker (cyclomatic 17): ClusterControllerInner::add_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":"src/meta/src/controller/cluster.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eda4477fd8198665ad669a0ef9c9aa3278ea233656a50725bd3d344a7158716"}},{"ruleId":"D1","level":"warning","message":{"text":"MinOverlappingPicker::pick_tables (cyclomatic 17): MinOverlappingPicker::pick_tables 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/meta/src/hummock/compaction/picker/min_overlap_compaction_picker.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"559a7e93d934c716ccb1a521ead858f2e29d61c152009c585fd7e155cd1e7431"}},{"ruleId":"D1","level":"warning","message":{"text":"ManualCompactionSelector::pick_compaction (cyclomatic 17): ManualCompactionSelector::pick_compaction 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":"src/meta/src/hummock/compaction/selector/manual_selector.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25d0f4ee48d9819745d3a48b7312bbe83e45712168237d7d8200016a9cf3eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"DdlController::replace_job (cyclomatic 17): DdlController::replace_job 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: DdlController::run_command (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":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"9747e225fab3d5f02b53192b0372883ff7cc34b266fb387546af09ac5fd1478a"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_object_store::object::build_remote_object_store (cyclomatic 17): risingwave_object_store::object::build_remote_object_store 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":"src/object_store/src/object/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de305309d16525d7071797e9e2b1ed25b142547316784cf892f094e8cb4eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_alter_index (cyclomatic 17): Parser::parse_alter_index 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: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b1cac6142dd017333fa3f40f95c562aad71d96336c2519ca1f0e462a9589f5"}},{"ruleId":"D1","level":"warning","message":{"text":"TableWatermarks::clear_stale_epoch_watermark (cyclomatic 17): TableWatermarks::clear_stale_epoch_watermark 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/storage/hummock_sdk/src/table_watermark.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0418a6c61265e034f0b80818eec4d496ed770c30bc58bce22a2866970c25fc9f"}},{"ruleId":"D1","level":"warning","message":{"text":"UploaderData::sync (cyclomatic 17): UploaderData::sync 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/storage/src/hummock/event_handler/uploader/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea7ca544afe4268fd6dd37c7b9c348fdc0128e370c06475514806f344435613"}},{"ruleId":"D1","level":"warning","message":{"text":"DynamicFilterExecutor::apply_batch (cyclomatic 17): DynamicFilterExecutor::apply_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":"src/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cf26b33e8366d51182d927487c2b10394eeb8b4780559439e1ba89612cb390"}},{"ruleId":"D1","level":"warning","message":{"text":"HashJoinExecutor::handle_watermark (cyclomatic 17): HashJoinExecutor::handle_watermark 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/stream/src/executor/hash_join.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a4044d75ffbe21a254341b52ce91e9e30aed9672c561fcc3931eac0ce6b5b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Nfa::walk (cyclomatic 17): Nfa::walk has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/match_recognize/nfa.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d110eb848eeb8938d7d3ce140366d02259ff2004d04df86f674b63bc817d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"IcebergListExecutor::into_stream (cyclomatic 17): IcebergListExecutor::into_stream 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/stream/src/executor/source/iceberg_list_executor.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"189ab3626ff31eccd53b0e6259001041c646474d6cd3b0d9c410ce5c8a24e3a4"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalBarrierWorker::run (cyclomatic 17): LocalBarrierWorker::run 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":"src/stream/src/task/barrier_worker/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"16239dc908799d02e10dc09edc303cc44b5a8af08ceda651739e003b91881362"}},{"ruleId":"D1","level":"warning","message":{"text":"RowSeqScanExecutor::do_execute (cyclomatic 16): RowSeqScanExecutor::do_execute 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/batch/executors/src/executor/row_seq_scan.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"398b3cc2660dcee5268d4aba7d0de5ba4930a3dc93f6aba2e1217e8d13d314ea"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_connector::sink::iceberg::create_table::field_is_compatible (cyclomatic 16): risingwave_connector::sink::iceberg::create_table::field_is_compatible 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/connector/src/sink/iceberg/create_table.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"641d5e591560775db6ed48c0b4058eab453a4652ae20ebf2f81ca9aa59a87244"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::meta::cluster_info::source_split_info (cyclomatic 16): risingwave_ctl::cmd_impl::meta::cluster_info::source_split_info 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/ctl/src/cmd_impl/meta/cluster_info.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"404262a2d21ca3f85b054db7d920f51c115ba07c28177d2b238d86c1e7764438"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_expr_impl::scalar::similar_to_escape::similar_escape_internal (cyclomatic 16): risingwave_expr_impl::scalar::similar_to_escape::similar_escape_internal 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":"src/expr/impl/src/scalar/similar_to_escape.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b3aff095178ee589d95325d25743965450fb07b9d8107d8a3d6e5dac2f1f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_expr_impl::scalar::jsonb_set::jsonbb_set_path (cyclomatic 16): risingwave_expr_impl::scalar::jsonb_set::jsonbb_set_path has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/jsonb_set.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6b8c6f08fb77157781e04cda7392e50839106296c47114767f97bc2259ed80"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_expr_impl::scalar::array_concat::array_cat (cyclomatic 16): risingwave_expr_impl::scalar::array_concat::array_cat 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/expr/impl/src/scalar/array_concat.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea79ee6f59c710fb6eb0f816509b489a2d581556d228b7d8a06ae14b74f47d5"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionAttr::generate_build_table_function (cyclomatic 16): FunctionAttr::generate_build_table_function 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":"src/expr/macro/src/gen.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"10243c224c7f1a696739e95ea15c4bb4ef2137452d0526bb08ae14bf5cad21e4"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyJoinTransposeRule::push_apply_both_side (cyclomatic 16): ApplyJoinTransposeRule::push_apply_both_side 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":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"483d86fac29a131bc2bf3c0a45774aec123364779071841ed27491ba5d17f0df"}},{"ruleId":"D1","level":"warning","message":{"text":"TableScanIoEstimator::match_index_column (cyclomatic 16): TableScanIoEstimator::match_index_column 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: TableScanIoEstimator::estimate_data_type_size (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/index_selection_rule.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b60944fb59479ca39f8f7b83c9c7b47c3137e2a0aa74646db09a28f247d4a56"}},{"ruleId":"D1","level":"warning","message":{"text":"TopNToVectorSearchRule::resolve_vector_search (cyclomatic 16): TopNToVectorSearchRule::resolve_vector_search 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/frontend/src/optimizer/rule/top_n_to_vector_search_rule.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b411e1e30cac70c8b2defbd9c8eb71e53512b84853d0031e84ab892036c9687c"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifyFirstLastValueRule::apply (cyclomatic 16): UnifyFirstLastValueRule::apply 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/frontend/src/optimizer/rule/unify_first_last_value_rule.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8f5597d503850cee137c737083c5a270132b5c4eb946224e491068787cbd9f"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchPlanFragmenter::new_stage (cyclomatic 16): BatchPlanFragmenter::new_stage 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/frontend/src/scheduler/plan_fragmenter.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"47edf12789f51d1a04c54897e58e8de86c74f4dfbaf79f028b6ad2276665e3c9"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManagerImpl::connect_inner (cyclomatic 16): SessionManagerImpl::connect_inner 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":"src/frontend/src/session.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed01c7c5e44423c4eb08c6de8c82c7b9183f9c90ea25d89f7caec4c7d245b312"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::create_table::create_iceberg_engine_table (cyclomatic 16): risingwave_frontend::handler::create_table::create_iceberg_engine_table 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/frontend/src/handler/create_table.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7968ac8bcc596c5b1e50941751a7f087e6cb4ed499d433fbf78d1abe056f6cde"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::handler::show::handle_show_create_object (cyclomatic 16): risingwave_frontend::handler::show::handle_show_create_object 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/frontend/src/handler/show.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a3b85ab112172fa0899c88454a4da1ad91dea58c71feda1af1876d15af987"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_frontend::binder::relation::match_recognize::check_pattern_bounds (cyclomatic 16): risingwave_frontend::binder::relation::match_recognize::check_pattern_bounds 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/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5bb4567f4abe9a6f24142dcea38e6878c1aa53fa5653b73fe5489370d3685a"}},{"ruleId":"D1","level":"warning","message":{"text":"DdlServiceImpl::create_iceberg_table (cyclomatic 16): DdlServiceImpl::create_iceberg_table 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/meta/service/src/ddl_service.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdba3929acadb8ede70aff2ccb985da27b7ed537d60082b572b2fb8fc80a3077"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::revoke_privilege (cyclomatic 16): CatalogController::revoke_privilege 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/meta/src/controller/user.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dea87be408cb97ea0da0b38093b11e29dba89f809e888a4cd26d5ba2a090ce"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogController::grant_default_privileges (cyclomatic 16): CatalogController::grant_default_privileges 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":"src/meta/src/controller/user.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e71ac45d5eaa108e9754ed8f7314f57c581fec420fb03547595337794b4543"}},{"ruleId":"D1","level":"warning","message":{"text":"HummockManager::write_time_travel_metadata (cyclomatic 16): HummockManager::write_time_travel_metadata has cyclomatic complexity 16 (threshold 15). Of this number, 12 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":"src/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf63c6cf63feed2431d22dcfe6ff185aa1f93826b5fc6033613a9b8cdca1fba"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceManagerCore::reassign_splits (cyclomatic 16): SourceManagerCore::reassign_splits 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/meta/src/stream/source_manager/split_assignment.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faba921001540d268e16d8bf8e26c57d66339533e6579a367206ff8fb8c6d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_meta::hummock::metrics_utils::trigger_sst_stat (cyclomatic 16): risingwave_meta::hummock::metrics_utils::trigger_sst_stat 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/meta/src/hummock/metrics_utils.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"583df5e51057e16260701fff5715fb6afa762703ae5ed9bb60b9b0c9c021e15c"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_meta::serving::start_serving_vnode_mapping_worker (cyclomatic 16): risingwave_meta::serving::start_serving_vnode_mapping_worker 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/meta/src/serving/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9984474da7d3e789291f3002a1638803f482212a60a6a5316496ffa95f82e537"}},{"ruleId":"D1","level":"warning","message":{"text":"risedev_config::main (cyclomatic 16): risedev_config::main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Components::from_env (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/config/src/main.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"facab21f26c8066cac48d3e9ef171d2cbdaa03ff9e9f0a47a45a845c6ffd2e2a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_format_encode_with_connector (cyclomatic 16): Parser::parse_format_encode_with_connector 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/sqlparser/src/ast/statement.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cc4b6c62cde84d0fbe5d45043002c3a49cd0ac6b2a93b54fc0fa3c37d30690"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_create_table (cyclomatic 16): Parser::parse_create_table has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97efdfceca317f4d4f283277a76c331e9efb408ba122b2a63797904648e316d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_value_and_obj_ref (cyclomatic 16): Parser::parse_value_and_obj_ref 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: Parser::parse_statement (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d993eab636f49ee0ce5bdb9e2b46b894ee178c90a53c321c529b5faf9127d862"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_hummock_sdk::compaction_group::hummock_version_ext::validate_version (cyclomatic 16): risingwave_hummock_sdk::compaction_group::hummock_version_ext::validate_version 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/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b4549223c1aa52e55312dd2682c3b422cc9164b658f699feaa886e4528423a"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_storage::hummock::local_version::pinned_version::start_pinned_version_worker (cyclomatic 16): risingwave_storage::hummock::local_version::pinned_version::start_pinned_version_worker 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/storage/src/hummock/local_version/pinned_version.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0f973729796b676bdafe8618ff2ebc75c8715ab6cd213ce89135dea4ba01c9"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncLogStoreDispatchExecutor::execute (cyclomatic 16): SyncLogStoreDispatchExecutor::execute 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/stream/src/executor/dispatch/dispatch_sync_log_store.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c1425eb584b6152a370209b0f493504eb5bba9a6e64f68162db75ddf0f9b16"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchRecognizeExecutor::emit_ready (cyclomatic 16): MatchRecognizeExecutor::emit_ready 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/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"2984514f367e681c7c2d5d048959d1573b43dc18f0a743ac33d80c7f14b5ac9c"}},{"ruleId":"D1","level":"warning","message":{"text":"NestedLoopTemporalJoinExecutor::into_stream (cyclomatic 16): NestedLoopTemporalJoinExecutor::into_stream 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/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b625fb5fe3e822cd0b07bc2048ed3f34ed9dd39d8f652cb1852b2840154ac72"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceExecutorBuilder::new_boxed_executor (cyclomatic 16): SourceExecutorBuilder::new_boxed_executor 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/stream/src/from_proto/source/trad_source.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"db808240a4b22f216782921f7f49f1e4741fc164aa1bdd72ee7211afa151c2da"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalBarrierWorker::handle_actor_op (cyclomatic 16): LocalBarrierWorker::handle_actor_op 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":"src/stream/src/task/barrier_worker/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c56df2db1b6c8d69247455144d43853722998659f99210baa08d5ef9f691a5"}},{"ruleId":"D1","level":"warning","message":{"text":"risingwave_stream::executor::backfill::snapshot_backfill::executor::make_consume_snapshot_stream (cyclomatic 16): risingwave_stream::executor::backfill::snapshot_backfill::executor::make_consume_snapshot_stream has cyclomatic complexity 16 (threshold 15). Of this number, 14 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":"src/stream/src/executor/backfill/snapshot_backfill/executor.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4c7400b3afcabbf0e8be2c1d438e178b94c13d22b106c2aa26122c693335ee"}},{"ruleId":"D1","level":"warning","message":{"text":"PgProtocol::do_process (cyclomatic 16): PgProtocol::do_process 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/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"757cbf844abfd631181edcdefd53219c95552ea7bf74a98d8dd31d47650dd4bf"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlServerValidator.validateTableSchema (cyclomatic 16): SqlServerValidator.validateTableSchema 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaecfb4228826b86b8aeed4935243ffd61e5592cfe13e6ebf478f1c97945b2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ParallelizedCdcBackfillExecutor::execute_inner (cognitive 389): ParallelizedCdcBackfillExecutor::execute_inner has cognitive complexity 389 (threshold 15). Drivers by points: if/else 43 (244 pts), match/switch 13 (80 pts), loops 13 (59 pts), boolean chains 6 (nesting depth added 314). To reduce it, split the body into named stages: move each independent step or branch into 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/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a577a54131b888ad5f9c064cea4e2c3759e95e53cd741a149761d439b30f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"CdcBackfillExecutor::execute_inner (cognitive 195): CdcBackfillExecutor::execute_inner has cognitive complexity 195 (threshold 15). Drivers by points: if/else 33 (116 pts), match/switch 9 (38 pts), loops 10 (34 pts), boolean chains 7 (nesting depth added 136). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41ed4282b71facb1953465d16602e0b136c620121ec49ecb04c2e9ba51a5602"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializeExecutor::execute_inner (cognitive 182): MaterializeExecutor::execute_inner has cognitive complexity 182 (threshold 15). Drivers by points: if/else 32 (117 pts), match/switch 10 (44 pts), loops 5 (13 pts), boolean chains 8 (nesting depth added 127). To reduce it, split the body into named stages: move each independent step or branch into 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/stream/src/executor/mview/materialize.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"709482216c7db4cfa8e75bfce4ba6a0d9c1bae3671932305172ac789f63d23e2"}},{"ruleId":"D2","level":"warning","message":{"text":"DmlExecutor::execute_inner (cognitive 172): DmlExecutor::execute_inner has cognitive complexity 172 (threshold 15). Drivers by points: if/else 22 (103 pts), loops 10 (54 pts), match/switch 4 (14 pts), boolean chains 1 (nesting depth added 135). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dml.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be04f25ee36b634e98137ef087ea77e038851d07ccb543bdcf5ad29d1147d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceBackfillExecutorInner::execute (cognitive 165): SourceBackfillExecutorInner::execute has cognitive complexity 165 (threshold 15). Drivers by points: if/else 33 (126 pts), match/switch 7 (21 pts), loops 7 (15 pts), boolean chains 3 (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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66095bc1ed5e41a16c2b231565b31321850d3f6d04c08720ce2f5c45e5f6e93"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceExecutor::execute_inner (cognitive 148): SourceExecutor::execute_inner has cognitive complexity 148 (threshold 15). Drivers by points: if/else 36 (120 pts), match/switch 4 (15 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 101). To reduce it, split the body into named stages: move each independent step or branch into 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/stream/src/executor/source/source_executor.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8581dad7a45ff100f1c02eacd9a470ad09f758e5080600197666c354feb8a7"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::system_param::set_system_param (cognitive 145): risingwave_common::system_param::set_system_param has cognitive complexity 145 (threshold 15). Drivers by points: if/else 90 (144 pts), match/switch 1 (nesting depth added 54). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/common/src/system_param/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc29c4095b83bed50ed83831444749f8ad4b024224a7d4a6e9bb72a6eaa9c230"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalBarrierWorker::run_inner (cognitive 138): GlobalBarrierWorker::run_inner has cognitive complexity 138 (threshold 15). Drivers by points: if/else 27 (99 pts), match/switch 10 (33 pts), loops 2 (6 pts) (nesting depth added 99). To reduce it, split the body into named stages: move each independent step or branch into 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/meta/src/barrier/worker.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e94bd55df9dc9a20eec346853c0be4292bccff7d20dd4cd6da43a9cdd3ef624"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement::fmt_unchecked (cognitive 138): Statement::fmt_unchecked has cognitive complexity 138 (threshold 15). Drivers by points: if/else 66 (119 pts), match/switch 7 (13 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/ast/mod.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df434a221a8acaa26348d5c30b61e1c46f8aaf96a38597d54c2ae7d5a911e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrangementBackfillExecutor::execute_inner (cognitive 137): ArrangementBackfillExecutor::execute_inner has cognitive complexity 137 (threshold 15). Drivers by points: if/else 20 (74 pts), loops 10 (34 pts), match/switch 6 (26 pts), boolean chains 3 (nesting depth added 98). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/arrangement_backfill.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6318c3aab7e57b6c185ac629bb9075213ee21369ed9813a5c1a2691cecce97d6"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseCheckpointControl::apply_command (cognitive 127): DatabaseCheckpointControl::apply_command has cognitive complexity 127 (threshold 15). Drivers by points: if/else 35 (68 pts), loops 19 (47 pts), match/switch 5 (9 pts), boolean chains 3 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e95f474b2dbcbb4b2087e4e96905b98e24652f34c48d272913962eba784846"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::start_iceberg_compactor (cognitive 119): risingwave_storage::hummock::compactor::start_iceberg_compactor has cognitive complexity 119 (threshold 15). Drivers by points: if/else 17 (75 pts), match/switch 9 (34 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"61827e1a6c15a77c0b0268a9dd9303bac0460260537e7836973102c7ae8e7bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::execute (cognitive 118): Inner::execute has cognitive complexity 118 (threshold 15). Drivers by points: if/else 11 (48 pts), loops 10 (43 pts), match/switch 5 (24 pts), boolean chains 3 (nesting depth added 89). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/project/project_set.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"552ed8468ab3314b4f9f981f4eb4cd74af1e0f4de661d1cdf93f544cbd03d722"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::parser::unified::debezium::parse_schema_change (cognitive 115): risingwave_connector::parser::unified::debezium::parse_schema_change has cognitive complexity 115 (threshold 15). Drivers by points: match/switch 10 (61 pts), if/else 13 (45 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 87). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/connector/src/parser/unified/debezium.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"def1ab020d11f4832e6b362f655f9da300b8ff0e42084aec654f8276aefcc409"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalityProviderExecutor::execute_inner (cognitive 114): LocalityProviderExecutor::execute_inner has cognitive complexity 114 (threshold 15). Drivers by points: if/else 15 (51 pts), loops 10 (32 pts), match/switch 8 (29 pts), boolean chains 2 (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/locality_provider.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7554724c234f9bc83677a94a59dcf484968bb9b3e328dfb8c0b822d427d71a"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlServerStreamingChangeEventSource.executeIteration (cognitive 102): SqlServerStreamingChangeEventSource.executeIteration has cognitive complexity 102 (threshold 15). Drivers by points: if/else 25 (68 pts), loops 5 (12 pts), boolean chains 10, error handling 3 (7 pts), ternaries 2 (5 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/sqlserver/SqlServerStreamingChangeEventSource.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac8e45a75c9010b4e69808fa69c665a460172384d2e8893e5374b3667c6c630"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::handle (cognitive 100): risingwave_frontend::handler::handle has cognitive complexity 100 (threshold 15). Drivers by points: if/else 26 (56 pts), match/switch 19 (40 pts), loops 1 (3 pts), boolean chains 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":"src/frontend/src/handler/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"929fc120ce0b3e6e2624713e3bfe8944bd10c371d4110af2ada588967b4b345d"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::expr::type_inference::func::infer_type_for_special (cognitive 98): risingwave_frontend::expr::type_inference::func::infer_type_for_special has cognitive complexity 98 (threshold 15). Drivers by points: if/else 18 (40 pts), match/switch 20 (35 pts), loops 8 (17 pts), boolean chains 6 (nesting depth added 46). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbc0f94f09f5511d49f163fa1f3ad618764581491d6cc4bcd5c2c3131708061"}},{"ruleId":"D2","level":"warning","message":{"text":"DbzConnectorConfig.\u003Cinit\u003E (cognitive 97): DbzConnectorConfig.\u003Cinit\u003E has cognitive complexity 97 (threshold 15). Drivers by points: if/else 29 (82 pts), boolean chains 9, match/switch 1 (4 pts), loops 1, ternaries 1 (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2d0380af22f34e894bf9b38ce6e13923cf1c79c386cfca3a61bb5af82fd2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergCommon::build_jni_catalog_configs (cognitive 96): IcebergCommon::build_jni_catalog_configs has cognitive complexity 96 (threshold 15). Drivers by points: if/else 53 (79 pts), boolean chains 11, match/switch 3 (5 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":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"7425df0a42710ae53877bb4e9abf3de982a10bda97fd0096f5015640b585a4e4"}},{"ruleId":"D2","level":"warning","message":{"text":"AsOfJoinExecutor::eq_join_right (cognitive 96): AsOfJoinExecutor::eq_join_right has cognitive complexity 96 (threshold 15). Drivers by points: if/else 24 (66 pts), match/switch 6 (21 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"2990903c0f327811acc4f798e6917fce963c756d9a53f722f31abba661654951"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_sink::gen_sink_plan (cognitive 95): risingwave_frontend::handler::create_sink::gen_sink_plan has cognitive complexity 95 (threshold 15). Drivers by points: if/else 43 (75 pts), boolean chains 8, loops 3 (8 pts), match/switch 3 (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":"src/frontend/src/handler/create_sink.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76540be2fa889d0dc5a6936abb5249f03cda62ea1f1b592b0801c40e0c0c425"}},{"ruleId":"D2","level":"warning","message":{"text":"WatermarkFilterExecutorInner::execute_inner (cognitive 94): WatermarkFilterExecutorInner::execute_inner has cognitive complexity 94 (threshold 15). Drivers by points: if/else 24 (68 pts), match/switch 5 (14 pts), boolean chains 6, loops 2 (6 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/watermark_filter.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc858dee664f1e4251d47539e792e95661bbb589a0a99add2cbdd1451a5cd80"}},{"ruleId":"D2","level":"warning","message":{"text":"GapFillExecutor::execute_inner (cognitive 91): GapFillExecutor::execute_inner has cognitive complexity 91 (threshold 15). Drivers by points: if/else 16 (67 pts), loops 4 (14 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b3c51d526cf2834f7e1e3bebfe2b3a7f6e1baf9eedbbfd152cc62777685e89"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::start_compactor (cognitive 84): risingwave_storage::hummock::compactor::start_compactor has cognitive complexity 84 (threshold 15). Drivers by points: if/else 10 (43 pts), match/switch 9 (36 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 61). Of this number, 81 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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e20b8dfa28f8d11accc851ec61183a9e3195e0f7ee0840170c3549c77d919bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkExecutor::process_msg (cognitive 83): SinkExecutor::process_msg has cognitive complexity 83 (threshold 15). Drivers by points: if/else 14 (49 pts), loops 6 (24 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/sink.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b10b99736b89b6f44b6f3d94493b1351676b368d9149e8240920678568e3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::execute (cognitive 81): Inner::execute has cognitive complexity 81 (threshold 15). Drivers by points: if/else 16 (53 pts), match/switch 5 (17 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/project/project_scalar.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"340d2a3d37e8f74875930860c509c021e2341ba8501fef7650848534d43e5c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBackfillExecutor::execute_inner (cognitive 80): SnapshotBackfillExecutor::execute_inner has cognitive complexity 80 (threshold 15). Drivers by points: if/else 30 (64 pts), loops 4 (12 pts), match/switch 2 (4 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":"src/stream/src/executor/backfill/snapshot_backfill/executor.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173b6412b9ce7a3e28ae20605fb9d284ba675d01152510cb6fe16a2372771b6"}},{"ruleId":"D2","level":"warning","message":{"text":"OverWindowExecutor::apply_chunk (cognitive 79): OverWindowExecutor::apply_chunk has cognitive complexity 79 (threshold 15). Drivers by points: if/else 24 (61 pts), match/switch 3 (10 pts), loops 4 (6 pts), boolean chains 2 (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":"src/stream/src/executor/over_window/general.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb764bce2493ad7b6938224da8b8da469e67cb2321ee34c597d355e4eeeffbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_builtin_scalar_function (cognitive 77): Binder::bind_builtin_scalar_function has cognitive complexity 77 (threshold 15). Drivers by points: if/else 53 (59 pts), boolean chains 9, match/switch 5 (6 pts), loops 3 (nesting depth added 7). Of this number, 73 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, and where an else follows 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/frontend/src/binder/expr/function/builtin_scalar.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6198feb6a17a46682d33a3b8a5badd30ddb9271eaa4125280bbb82bf151d50fe"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::bind_all_columns (cognitive 76): risingwave_frontend::handler::create_source::bind_all_columns has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (58 pts), loops 2 (9 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5a489e2689869686b19fb51ce276fb920d75db48d1b8b605bae9304f0a9a19"}},{"ruleId":"D2","level":"warning","message":{"text":"FsFetchExecutor::into_stream (cognitive 74): FsFetchExecutor::into_stream has cognitive complexity 74 (threshold 15). Drivers by points: if/else 13 (47 pts), match/switch 6 (25 pts), boolean chains 1, loops 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":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"71455a8b762a0675cb5b66fdfe41bb8b34cdd394e515b873099af44f12763894"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamSink::create (cognitive 73): StreamSink::create has cognitive complexity 73 (threshold 15). Drivers by points: if/else 34 (51 pts), boolean chains 18, match/switch 3 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_sink.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5959be7e86a543d03e14bfdd53e10f68fbf980ec188616d69e96d6e93c7561"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.process_file (cognitive 73): extract.process_file has cognitive complexity 73 (threshold 15). Drivers by points: if/else 19 (63 pts), boolean chains 8, loops 2 (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":"docs/metrics/extract.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79974b3d64895286b1771f866e6b4df34d3f210d18e1e8006627264920ea997"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_execute (cognitive 72): HashJoinExecutor::do_execute has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 11 (27 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba341630d894447e5dac501a4938b4ef37d2ff5311ccddc093f120bfdb2a108e"}},{"ruleId":"D2","level":"warning","message":{"text":"CoordinatedLogSinker::consume_log_and_sink (cognitive 72): CoordinatedLogSinker::consume_log_and_sink has cognitive complexity 72 (threshold 15). Drivers by points: if/else 19 (56 pts), match/switch 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/coordinate.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ec72f923882a8f6e50aae97db10c90a0cb0fbd394e0996ba28394a0f5c88f0"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::parser::parse_message_stream (cognitive 69): risingwave_connector::parser::parse_message_stream has cognitive complexity 69 (threshold 15). Drivers by points: if/else 10 (36 pts), loops 6 (19 pts), match/switch 4 (14 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":"src/connector/src/parser/mod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef919b6f7b06fc3ac95ef2cd404ef5e65ddbec8ae9ae2752382348b7f19c798"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicFilterExecutor::execute_inner (cognitive 69): DynamicFilterExecutor::execute_inner has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (55 pts), loops 3 (8 pts), match/switch 2 (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":"src/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7427354350a1033d460cae3fcc38fac954833f2a89ea3eb2113d2caca18f11bb"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::temporal_join::phase1::handle_chunk (cognitive 69): risingwave_stream::executor::temporal_join::phase1::handle_chunk has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 5 (19 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bf9943b9e72d4da96bd1d9740a9bb9b48b3015040ef64bf01dd02cbd60de8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::next_token (cognitive 68): Tokenizer::next_token has cognitive complexity 68 (threshold 15). Drivers by points: if/else 11 (34 pts), match/switch 11 (28 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 43). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/tokenizer.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb95d54cf7c244545cac823f128f1e346ba361b50549c065161470f4e2918734"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockVersionCommon::build_sst_delta_infos (cognitive 68): HummockVersionCommon::build_sst_delta_infos has cognitive complexity 68 (threshold 15). Drivers by points: if/else 13 (43 pts), loops 7 (21 pts), match/switch 1 (3 pts), boolean chains 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":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"040b1a89cd0aa513929bf7042e5b36a81171dcec60db1a0a2362d3bb49fbf2e5"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::handle_privilege::make_prost_privilege (cognitive 67): risingwave_frontend::handler::handle_privilege::make_prost_privilege has cognitive complexity 67 (threshold 15). Drivers by points: loops 22 (45 pts), match/switch 7 (18 pts), if/else 1 (4 pts) (nesting depth added 37). 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":"src/frontend/src/handler/handle_privilege.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4926f190817d74f49701727e626dfd1c5264b5191154bce67925a00a4303bf80"}},{"ruleId":"D2","level":"warning","message":{"text":"UpstreamTableExecutor::into_stream (cognitive 67): UpstreamTableExecutor::into_stream has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (52 pts), loops 4 (10 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/executor.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a8ab46b2f01e00706c96ea1885b1f931a98043d98ff607104797e423eb64a3"}},{"ruleId":"D2","level":"warning","message":{"text":"HopWindowExecutor::execute_inner (cognitive 67): HopWindowExecutor::execute_inner has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (50 pts), loops 4 (11 pts), match/switch 2 (6 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":"src/stream/src/executor/hop_window.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae79385eff7b7232c736cc3d3af02ada8808078f21f35b927598d5469961c79"}},{"ruleId":"D2","level":"warning","message":{"text":"Condition::analyze_group (cognitive 66): Condition::analyze_group has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (45 pts), match/switch 4 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/condition.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a04c3112eb0fa2d83feb6730140ff91f32f5aa54c4fe341ab3f311106cfd6f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_gap_fill (cognitive 65): Binder::bind_gap_fill has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (54 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (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":"src/frontend/src/binder/relation/gap_fill.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b574805cecada54d942ab027f325609fcea3d2ff23493f8998209cd2ab976424"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCase::apply_query (cognitive 64): TestCase::apply_query has cognitive complexity 64 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 13 (26 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":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe84904ec82d3b79276b4fb113da8261d10f55844b433dbbc635ed845dbe952"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::scalar::to_char::format_inner (cognitive 63): risingwave_expr_impl::scalar::to_char::format_inner has cognitive complexity 63 (threshold 15). Drivers by points: if/else 28 (58 pts), match/switch 3 (5 pts) (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/to_char.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1ec35fe4da524c81704b274aaf747e80c08260f072646b7dd0dd7fedb3bd54"}},{"ruleId":"D2","level":"warning","message":{"text":"Condition::disjunctions_to_scan_ranges (cognitive 63): Condition::disjunctions_to_scan_ranges has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (39 pts), match/switch 4 (12 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 32). Of this number, 47 points are the body\u0027s own statements and 16 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/condition.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f85d01d7c0b6cd82387b56e18343040082ba8af96ee39f135dcf349039fc2f"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchRecognizeExecutor::execute_inner (cognitive 62): MatchRecognizeExecutor::execute_inner has cognitive complexity 62 (threshold 15). Drivers by points: if/else 11 (40 pts), loops 6 (18 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ff82ea407c07acddaeec0810a8660323ff2b90d893e82a1cf46733a9a50d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"TemporalJoinExecutor::into_stream (cognitive 62): TemporalJoinExecutor::into_stream has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 5 (18 pts), match/switch 1 (2 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":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b3825f62e423ee4fad6df348ee6e463b9d2303c14f7b80ce1374dba53cff7a"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresValidator.validatePublicationConfig (cognitive 62): PostgresValidator.validatePublicationConfig has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (40 pts), loops 10 (18 pts), boolean chains 3, error handling 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"879c3c83ecc53780d5e8041acc12b236d9ce8549b35074aff3cf03bdf3443047"}},{"ruleId":"D2","level":"warning","message":{"text":"HashAggExecutor::do_execute (cognitive 61): HashAggExecutor::do_execute has cognitive complexity 61 (threshold 15). Drivers by points: loops 14 (36 pts), if/else 9 (19 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 34). 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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2b5f18e7305b872a6c658f78a7ee0dd79443851f204c1b529587a7b7fd7b74"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_function (cognitive 61): Binder::bind_function has cognitive complexity 61 (threshold 15). Drivers by points: if/else 39 (52 pts), boolean chains 6, match/switch 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":"src/frontend/src/binder/expr/function/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2326cba9b7ca666a6c01ce7b7e219b86a8420d6c1193fe8de3ff8282b02a40a9"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockVersionCommon::apply_version_delta (cognitive 61): HummockVersionCommon::apply_version_delta has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 6 (7 pts), boolean chains 3, match/switch 1 (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":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b068ca94ac6c9caab80295ed6c2031b811d7321f9505cc9cbadcb3a85ba563"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::scalar::regexp::regexp_replace (cognitive 60): risingwave_expr_impl::scalar::regexp::regexp_replace has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (45 pts), loops 3 (11 pts), boolean chains 2, match/switch 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":"src/expr/impl/src/scalar/regexp.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ac3fc47d192feb009d4f9e94defd054e514248b64a116824b1a5c12f637437"}},{"ruleId":"D2","level":"warning","message":{"text":"AsOfJoinExecutor::eq_join_left (cognitive 60): AsOfJoinExecutor::eq_join_left has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (46 pts), match/switch 4 (12 pts), boolean chains 1, loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"9739206c0073b4ccf65d7273583d0b780d763eb8214dbb883d028c3cbf9ba14f"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::execute (cognitive 60): Inner::execute has cognitive complexity 60 (threshold 15). Drivers by points: loops 8 (32 pts), if/else 5 (16 pts), match/switch 3 (10 pts), boolean chains 2 (nesting depth added 42). 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":"src/stream/src/executor/project/materialized_exprs.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd443658d24791b69bf0f5434a1710b4b664de9b9f19c65301fc54ccf49d26f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_table_and_joins (cognitive 59): Parser::parse_table_and_joins has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (40 pts), match/switch 5 (18 pts), loops 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":5495}}}],"partialFingerprints":{"codehealthFindingId/v1":"96383428c467583fa3c9cd219104ac99361ae9c2d4d5816fe59e1e8ac763f59d"}},{"ruleId":"D2","level":"warning","message":{"text":"NowExecutor::execute_inner (cognitive 59): NowExecutor::execute_inner has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (45 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/now.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0fd41b43a070717f0498b8c0d0acfdaf97726d7211c93e3ef82adec9ecc51f"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaSplitReader::into_data_event_stream (cognitive 58): KafkaSplitReader::into_data_event_stream has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 6 (11 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/kafka/source/reader.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c78520e6073277de747023c1ce8fc686e8f57e2caeb3fa3dd49ff5e32ee56d"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockVersionReader::get (cognitive 58): HummockVersionReader::get has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (50 pts), loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb103c06209cba94a6360b0c633a938b900a8cd887afdf9473d91be65c36608"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchOpendalFsFetchExecutor::into_stream (cognitive 58): BatchOpendalFsFetchExecutor::into_stream has cognitive complexity 58 (threshold 15). Drivers by points: if/else 7 (30 pts), match/switch 5 (19 pts), loops 2 (6 pts), boolean chains 3 (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":"src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74632eb94360fab7639887b496323747a693a6759302a53f536b37171af452"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentGraph.FragmentGraph (cognitive 56): FragmentGraph.FragmentGraph has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (32 pts), ternaries 9 (18 pts), boolean chains 5, loops 1 (nesting depth added 26). Most of this is not in the body itself: 2 of the 56 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 242, 477, 492, \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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc711a405f16d96fb9021750f29db65b5db0c30180e46f258e99387ec48c4c79"}},{"ruleId":"D2","level":"warning","message":{"text":"UploaderData::sync (cognitive 55): UploaderData::sync has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 6 (17 pts), boolean chains 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":"src/storage/src/hummock/event_handler/uploader/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8900d06b800e03d4ebb9d5819d7c831c24a2796d28123145e19eca0263447eb"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionCache::shrink (cognitive 55): PartitionCache::shrink has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 6 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/range_cache.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f6bb7af8d35168ae24ff83fae15187acdb419557db370f5cb3a858f6e68002"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialGraphManager::next_event_inner (cognitive 54): PartialGraphManager::next_event_inner has cognitive complexity 54 (threshold 15). Drivers by points: if/else 7 (27 pts), match/switch 7 (25 pts), loops 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/partial_graph.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a37909c099550bb52e9cba78bd9ef1efe5dce38885c5ae70d0915e6758c835"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::controller::system_param::merge_params (cognitive 54): risingwave_meta::controller::system_param::merge_params has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 18 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/system_param.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"035ae1c51498b31742b429a323ab0307e9a7f0b9ff0bccb60a4f59a7dd9b1eea"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::dashboard::handlers::get_streaming_stats_from_prometheus (cognitive 54): risingwave_meta::dashboard::handlers::get_streaming_stats_from_prometheus has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 8 (17 pts), boolean chains 4 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/dashboard/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3124850c5e52c3ed6dab03648135100c660d318afa9a975459e1d6af20ef07bd"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::types::variant::parse_path (cognitive 53): risingwave_common::types::variant::parse_path has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 5 (15 pts), boolean chains 3, match/switch 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":"src/common/src/types/variant.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"187957377308f139d2ec94819386b92ae5b0e976b3d27687bec306cad7cf7f66"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::explain::do_handle_explain (cognitive 53): risingwave_frontend::handler::explain::do_handle_explain has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 9 (23 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":"src/frontend/src/handler/explain.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cb6083b071ea7343acc4ca35b121f95ae41480d603300c6dce65f04ee94a26"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointControl::handle_new_barrier (cognitive 53): CheckpointControl::handle_new_barrier has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 2 (7 pts), match/switch 3 (7 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":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed672150af59f543c5cee8ed3fcc6c10bd5a720197f09d1ad860495b5dbd19a"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalBarrierWorker::recovery_inner (cognitive 53): GlobalBarrierWorker::recovery_inner has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 5 (12 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/worker.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf51ab217b4086ce783d97f8964887e0ef956091a083db2b96c86b661787981"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::drop_object (cognitive 51): CatalogController::drop_object has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 6 (10 pts), boolean chains 7, match/switch 5 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/drop_op.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"716e716e28aa3945a523f47d55fcc2d43cec50c97b3695dfd0a4bd334b911e39"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_table (cognitive 51): Parser::parse_alter_table has cognitive complexity 51 (threshold 15). Drivers by points: if/else 36 (48 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"828b62b4052ea1643b8d9125b578925ed593021fc191b84761396cd8cb34fd54"}},{"ruleId":"D2","level":"warning","message":{"text":"WaitCheckpointTask::run_with_on_commit_success (cognitive 50): WaitCheckpointTask::run_with_on_commit_success has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 5 (12 pts), match/switch 5 (10 pts) (nesting depth added 30). Of this number, 44 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e93e0a4cadfbd81e2d23a2e3338e310bf561d7a564853798eece09acff246fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_match_recognize (cognitive 50): Binder::bind_match_recognize has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 9 (10 pts), match/switch 4 (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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7782ce818f97414da7ffdc032d081be035c319b7cb8eb1593229af4bf9b7d351"}},{"ruleId":"D2","level":"warning","message":{"text":"Condition::split_row_cmp_to_scan_ranges (cognitive 50): Condition::split_row_cmp_to_scan_ranges has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 3 (11 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/condition.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e0ac7fd4a543c91e7c4ab3dada76accf7b4c421abc925eb64b2faa58244f53"}},{"ruleId":"D2","level":"warning","message":{"text":"HashAggExecutor::execute_inner (cognitive 50): HashAggExecutor::execute_inner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 6 (14 pts), match/switch 1 (2 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":"src/stream/src/executor/aggregate/hash_agg.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"22605e754a51fbec492649cde8f758a8c1fc72dd002a6e5a10cb05ff37a646bb"}},{"ruleId":"D2","level":"warning","message":{"text":"NestedLoopTemporalJoinExecutor::into_stream (cognitive 50): NestedLoopTemporalJoinExecutor::into_stream has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 6 (21 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b19d025ef82933e63160e2a011b9f0c2b3ed82bb75e4f09d88db024caee8aaf"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergFetchExecutor::into_stream (cognitive 50): IcebergFetchExecutor::into_stream has cognitive complexity 50 (threshold 15). Drivers by points: if/else 6 (27 pts), match/switch 5 (16 pts), loops 2 (5 pts), 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":"src/stream/src/executor/source/iceberg_fetch_executor.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"417d9084e9a3338510630998453f9a759cb843e65a499147040f4e224cda2018"}},{"ruleId":"D2","level":"warning","message":{"text":"OverPartition::build_changes (cognitive 49): OverPartition::build_changes has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 5 (9 pts), boolean chains 2 (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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4931f30ece36429de55ca98fc23e486f3429aca250bda00f046bfef676212"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkExecutor::execute_consume_log (cognitive 49): SinkExecutor::execute_consume_log has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 4 (13 pts), loops 3 (5 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":"src/stream/src/executor/sink.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2c12b34804f7b787065c8eba9c249686d38716c4eb431e26ef81c620b583aa"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchPosixFsFetchExecutor::into_stream (cognitive 49): BatchPosixFsFetchExecutor::into_stream has cognitive complexity 49 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 4 (15 pts), loops 2 (6 pts), boolean chains 4 (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":"src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cb89f5e5b0d0ac99441bce5d0776e791ec401c4ae36d2e24580b58ebda2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ListValue::from_str (cognitive 48): ListValue::from_str has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (32 pts), match/switch 6 (10 pts), loops 5, 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":"src/common/src/array/list_array.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"1620c03fac4efc493fcae8f97a8bf33c781d144c1a63c3c6c411d424c993a0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::encoder::avro::on_field (cognitive 48): risingwave_connector::sink::encoder::avro::on_field has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 23 (42 pts), if/else 3 (6 pts) (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":"src/connector/src/sink/encoder/avro.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"83558b07a45b9d51bb0b6e8689d0e6f5e935a38039d477c913ab949ee7f67db7"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::iceberg_compaction::memory::estimate_plan_memory (cognitive 48): risingwave_storage::hummock::compactor::iceberg_compaction::memory::estimate_plan_memory has cognitive complexity 48 (threshold 15). Drivers by points: if/else 41 (43 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows 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/storage/src/hummock/compactor/iceberg_compaction/memory.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ee49d443a4f459ecb1d572e6ec78502a2837a2577d14b3711e8738fea0c224"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergListExecutor::into_stream (cognitive 48): IcebergListExecutor::into_stream has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 5 (16 pts), loops 2 (4 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":"src/stream/src/executor/source/iceberg_list_executor.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccfb10348344ac0a84a2fd0db1ce4a21d54891e16147e87ee6018e6668ff9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.split_top_args (cognitive 48): extract.split_top_args has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (31 pts), ternaries 2 (8 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c817804f14261f9660dcfaebfb7b6870c7afd88a59d8c8111cec94156dd7b9"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalQueryExecution::convert_plan_node (cognitive 47): LocalQueryExecution::convert_plan_node has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 8 (15 pts), loops 3 (9 pts), boolean chains 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":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01e1db48c5716b5245263199ceefa8a31b70c45e7761e531d8caac7ed2d6600"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_index::gen_create_index_plan (cognitive 47): risingwave_frontend::handler::create_index::gen_create_index_plan has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (26 pts), match/switch 6 (10 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_index.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"698b49d9f6ebbec458cb8da69dbbbad2e2160c34da5902e69b3c63648f23f4c5"}},{"ruleId":"D2","level":"warning","message":{"text":"NonOverlapSubLevelPicker::pick_sub_level (cognitive 47): NonOverlapSubLevelPicker::pick_sub_level has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 6 (11 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":"src/meta/src/hummock/compaction/picker/non_overlap_sub_level_picker.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"045b2831d1ba2c36ab6670d3718509a4ca08fb3d371ef516241a282f58874ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"CoordinatorWorker::run_coordination (cognitive 47): CoordinatorWorker::run_coordination has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (28 pts), match/switch 6 (15 pts), loops 2 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/sink_coordination/coordinator_worker.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bd308f1e2645c4f55f492694b5b556212c0fea93e8f678118b385112d3bd20"}},{"ruleId":"D2","level":"warning","message":{"text":"GapFillExecutor::generate_filled_rows_between_static (cognitive 47): GapFillExecutor::generate_filled_rows_between_static has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 6 (15 pts), loops 4 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0613df952d442aa6bed26a590668e242dd7f9e29d9e2f20745f2bf0d1e9d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_left_outer_join (cognitive 46): HashJoinExecutor::do_left_outer_join has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 3 (8 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"696ff258f3014653cc553a3fea794970146a8552a243a08d2074e5d9bb99522b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParseOptions::parse (cognitive 46): JsonParseOptions::parse has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 11 (22 pts), if/else 7 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/connector/src/parser/unified/json.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a874f450c8abc8bb80425465dcc9e76d4344050dca6a79ea7480957d732b271a"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::plan_select (cognitive 46): Planner::plan_select has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (32 pts), loops 3 (6 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/planner/select.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6a47ac86e1402810e8373243c188f19fc69a19d829221193b590e711d4f303"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::optimizer::plan_node::logical_kafka_scan::expr_to_kafka_timestamp_range (cognitive 46): risingwave_frontend::optimizer::plan_node::logical_kafka_scan::expr_to_kafka_timestamp_range has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (35 pts), match/switch 6 (9 pts), boolean chains 2 (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":"src/frontend/src/optimizer/plan_node/logical_kafka_scan.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"097d65585538315f1ee0daa377b912ec9e7505a38820d3df855088b2722c7f38"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutorInner::generate_filled_rows (cognitive 46): ExecutorInner::generate_filled_rows has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 9 (18 pts), loops 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":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b13bea861ad0fe5e7050cd4dec3456175c5ebf03fee31a45a53d6156a687f17"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.find_matching_paren (cognitive 46): extract.find_matching_paren has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (30 pts), ternaries 2 (8 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ea3d3581e1bdecae61cb94c0ca41c6a8e840faa69be9fa78a6fdaa2db48388"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectSetExecutor::do_execute (cognitive 45): ProjectSetExecutor::do_execute has cognitive complexity 45 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 6 (16 pts), match/switch 1 (5 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/project_set.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d694dea082cb413925a863011a74492657e72233dddf10f92dcbaacf1ce778b8"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::parser::unified::debezium::extract_bson_field (cognitive 45): risingwave_connector::parser::unified::debezium::extract_bson_field has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 5, loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0088c73ea75cd690313a3e28b99ac2147e1146465cdb483843151a2e614f07c"}},{"ruleId":"D2","level":"warning","message":{"text":"MonotonicityAnalyzer::visit_function_call (cognitive 45): MonotonicityAnalyzer::visit_function_call has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 13 (29 pts), if/else 6 (12 pts), boolean chains 4 (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":"src/frontend/src/optimizer/property/monotonicity.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"994f0460e559c44072cd1bc412b8ac6a904c985ee9bdea2a4f43fe47ad99d1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::datafusion::project_set::project_set_stream (cognitive 45): risingwave_frontend::datafusion::project_set::project_set_stream has cognitive complexity 45 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 6 (16 pts), match/switch 1 (5 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/datafusion/project_set.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8152ba48314f346a2e58be4b88d16bd4ffeed1c191eac99bdaf9430c2cde59"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::controller::utils::check_relation_name_duplicate (cognitive 45): risingwave_meta::controller::utils::check_relation_name_duplicate has cognitive complexity 45 (threshold 15). Drivers by points: if/else 30 (40 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into 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/meta/src/controller/utils.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a3d0a3b0d36ef36788bd8195e9e99fe4c4b0db3c4e43c307bd8e2b39b8817b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_view (cognitive 45): Parser::parse_alter_view has cognitive complexity 45 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 10 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into 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/sqlparser/src/parser.rs"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed102576c6d1bd8826ca822e16268c5cf9500d135809f44f10e5e1a32f72800"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_catalog_relation_by_name (cognitive 44): Binder::bind_catalog_relation_by_name has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (36 pts), boolean chains 5, loops 1 (2 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":"src/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d26b982d40273455e299387e6587703053ef211204ff480240d16a5ba0ce71"}},{"ruleId":"D2","level":"warning","message":{"text":"DdlServiceImpl::auto_schema_change (cognitive 44): DdlServiceImpl::auto_schema_change has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (8 pts), match/switch 2 (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":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5d385051313d03bf8070d139391289e98fd4760177f542859faf79666b3719"}},{"ruleId":"D2","level":"warning","message":{"text":"SpaceReclaimCompactionPicker::pick_compaction (cognitive 44): SpaceReclaimCompactionPicker::pick_compaction has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/picker/space_reclaim_compaction_picker.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de232f7dc62df737efb9d7f5e800b97aae8f1534fcf7069601b4fcb9cdbcc2d"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceManagerCore::reassign_splits (cognitive 44): SourceManagerCore::reassign_splits has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 4 (12 pts), loops 4 (7 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/source_manager/split_assignment.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcabcd602e988a37bc763397822abcddf0f1d3dc0213fc7369cac69d1e78780"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::start_shared_compactor (cognitive 44): risingwave_storage::hummock::compactor::start_shared_compactor has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 7 (28 pts), if/else 3 (13 pts), boolean chains 2, loops 1 (nesting depth added 31). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37d3b704c6331500f0004da6754005e9705b40c8e40b9cea8ccbea566db9f31"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncLogStoreDispatchExecutor::execute (cognitive 44): SyncLogStoreDispatchExecutor::execute has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 4 (12 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dispatch/dispatch_sync_log_store.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"623676f97a77661d74da74ba9e183d4e8d964f60026ab1c2e87ba5162963efb5"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::barrier_align::barrier_align (cognitive 44): risingwave_stream::executor::barrier_align::barrier_align has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 8 (26 pts), loops 5 (15 pts), if/else 2 (3 pts) (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/stream/src/executor/barrier_align.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"afee60e1766fa8dba4be8370405974dfbba5bcf6a03c0513545715e967c9daed"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultCache::consume (cognitive 44): ResultCache::consume has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 5 (12 pts), match/switch 3 (8 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":"src/utils/pgwire/src/pg_extended.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d93236b116040693b8f44b0f463f48206651dc55db6abce65dfd14022b4a38"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::encoder::proto::on_field (cognitive 43): risingwave_connector::sink::encoder::proto::on_field has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 21 (36 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/connector/src/sink/encoder/proto.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb33337bf6e6e82c1a777b0b3688024a84a039621f5376727b923f79733fde4"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::update_connection_and_dependent_objects_props (cognitive 43): CatalogController::update_connection_and_dependent_objects_props has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 8 (14 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":3280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c642b173b1be501249632d17a20884c2aa3d862af2fe6a584cd5e35d3bba83de"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::grant_default_privileges (cognitive 43): CatalogController::grant_default_privileges has cognitive complexity 43 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 7 (16 pts), boolean chains 1 (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/user.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb72cbb476bb877ebb2907e4eb33d66acbb0f033158ec5fc3cd4e0b38c8e415"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::compactor_runner::compact_and_build_sst (cognitive 43): risingwave_storage::hummock::compactor::compactor_runner::compact_and_build_sst has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 6, match/switch 1 (3 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compactor_runner.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f04a0d5d4c70b8d611344c05f80980e93a205179f80dcf4e5afa511de7ac015"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::lower_measure (cognitive 42): Binder::lower_measure has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 6, 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e168427c88c9facb37740bf8cc29fa9107497a31120ad02d2d6141beda42ee"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::serving::start_serving_vnode_mapping_worker (cognitive 42): risingwave_meta::serving::start_serving_vnode_mapping_worker has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (26 pts), match/switch 4 (14 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":"src/meta/src/serving/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fe3f9be371d0d7b99bdef6e6afeda096f60f596160cf088d18a7ac9ec7ba10"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_infix (cognitive 42): Parser::parse_infix has cognitive complexity 42 (threshold 15). Drivers by points: if/else 25 (34 pts), match/switch 4 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbf19f28b049ab58a009965ae26ea06e6f39eccfa7461c6713f3e97b02fc4dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplayWorker::handle_record (cognitive 42): ReplayWorker::handle_record has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (37 pts), match/switch 3 (5 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_trace/src/replay/worker.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5aeff96902c1db5ba435580fe3d55faf4bd32400fe44185dc598372114761b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeLogExecutor::execute_keyed (cognitive 42): ChangeLogExecutor::execute_keyed has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 4 (11 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":"src/stream/src/executor/changelog.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4cf375ace96784f4de35b2c0e110beac618788859d9f566513fe1d4f6ba620"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializeCache::handle_inner (cognitive 42): MaterializeCache::handle_inner has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (36 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mview/cache.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"615b5a9c2d195bcf020339bfa963df46ee70d0c8d947fadd19d9b9485149c338"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::parser::unified::debezium::bson_extract_number (cognitive 41): risingwave_connector::parser::unified::debezium::bson_extract_number has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 6 (13 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"72543884f75b091da05ae2fb155df14c6d16728d24985dc987e5ac05e3e5114e"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockVersionReader::iter_inner (cognitive 41): HummockVersionReader::iter_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 4 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e20d3c85a9a0859c20428413f7516f4f7c3110991ed6f99be9978fc19f3d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsumeUpstreamStream::poll_next (cognitive 41): ConsumeUpstreamStream::poll_next has cognitive complexity 41 (threshold 15). Drivers by points: loops 5 (17 pts), match/switch 6 (17 pts), if/else 2 (7 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":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"089e19a6acb08c06ff07a8cf3c9906d41073f5e8ee5d0172296f73928ad0eac1"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupJoinBase::do_execute (cognitive 40): LookupJoinBase::do_execute has cognitive complexity 40 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 5 (13 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/lookup_join_base.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5211874047bb90230257eb7d964eba04d9dcc77c46950cc59f40b23450cb6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisSink::validate (cognitive 40): RedisSink::validate has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 13, 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":"src/connector/src/sink/redis.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9d320e8fe84620549a46dbc27933e873add7e26984763914aeb22194110b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr::scalar::like::like_impl (cognitive 40): risingwave_expr::scalar::like::like_impl has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (25 pts), boolean chains 11, match/switch 1 (3 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/core/src/scalar/like.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4084a799b68427f3fd8f492fcdbe5332a01d7bb9ad3bae12a60fa384928d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"CorrelatedTopNToVectorSearchRule::apply (cognitive 40): CorrelatedTopNToVectorSearchRule::apply has cognitive complexity 40 (threshold 15). Drivers by points: if/else 25 (32 pts), boolean chains 3, match/switch 2 (3 pts), loops 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, and where an else follows 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/frontend/src/optimizer/rule/correlated_topn_to_vector_search.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c199eb38745454f01cc1b8855383dd3b9ae033c65f89a13cc2b45061077335a4"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::bind_source_pk (cognitive 40): risingwave_frontend::handler::create_source::bind_source_pk has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89c8b7d92adfd8833f290199087535b0550d222202f5e1e70f0ac5c3839e498"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialGraphManagedBarrierState::fmt (cognitive 40): PartialGraphManagedBarrierState::fmt has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 5 (15 pts), match/switch 1 (2 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":"src/stream/src/task/barrier_worker/managed_state.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6faaa24eb9fa9e747294bd5b086a3825e667788b7f4833f70121990f1a156e"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::vnode_mapping::vnode_placement::place_vnode (cognitive 39): risingwave_common::vnode_mapping::vnode_placement::place_vnode has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 7 (10 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":"src/common/src/vnode_mapping/vnode_placement.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a63762ad53381d8e789ed02f0e300680f25d1ba8bc64e25e278f1077f5e6fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::bind_create_source_or_table_with_connector (cognitive 39): risingwave_frontend::handler::create_source::bind_create_source_or_table_with_connector has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 5, 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":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"6add0765d34d08a15d6422133d60d8e250c20fc90227a0659bbec33f302e8df9"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::optimizer::plan_node::stream_hash_join::derive_watermark_for_hash_join (cognitive 39): risingwave_frontend::optimizer::plan_node::stream_hash_join::derive_watermark_for_hash_join has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 7, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_hash_join.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81a19434e280b27d497f2e3fdd0da6a25e88f35dd7f3a0db69cc728ff0679f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::fmt (cognitive 39): Expr::fmt has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 6 (9 pts), loops 4 (8 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/ast/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bd5cbeb46586083d212c723465906825963970a7cec62a3601470470f23fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_prefix (cognitive 39): Parser::parse_prefix has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 4 (9 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"90255e639971613b6ca9e026c56d48265f7670c8fa3b1752391b80b69bad3a47"}},{"ruleId":"D2","level":"warning","message":{"text":"TableWatermarks::clear_stale_epoch_watermark (cognitive 39): TableWatermarks::clear_stale_epoch_watermark has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 7 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/table_watermark.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b133887e7cac90d98639907587defe5fbda80e6d144448172b19c1134945cb75"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnDeduplicater::dedup (cognitive 39): ColumnDeduplicater::dedup has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 4 (8 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/aggregate/distinct.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"209f28cb3a0e2aca76ed229e7a1ef4fbc76c70bddf515e0dfa0b2db8a327c78c"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchAdbcSnowflakeFetchExecutor::into_stream (cognitive 39): BatchAdbcSnowflakeFetchExecutor::into_stream has cognitive complexity 39 (threshold 15). Drivers by points: if/else 4 (19 pts), match/switch 4 (15 pts), boolean chains 4, 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":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c120e0de0e203af95582d20da48a593e31bce558eab33f2eaa9ceeb4a61a13bb"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common_proc_macro::derive_estimate_size (cognitive 38): risingwave_common_proc_macro::derive_estimate_size has cognitive complexity 38 (threshold 15). Drivers by points: loops 6 (20 pts), if/else 4 (12 pts), match/switch 3 (6 pts) (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/proc_macro/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d010e8d7f8a5d115401e8df82caa2aae97ff0f14c85f59b280d71a1d602165"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergConnection::validate_connection (cognitive 38): IcebergConnection::validate_connection has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/connection.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"30576e0aa42cab30948405f7a2335e93135caf6d4045b76124bda33a6d680ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"KinesisSinkPayloadWriter::finish (cognitive 38): KinesisSinkPayloadWriter::finish has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/kinesis.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c3775faddae28db0281392788afe24b7686ca6ddae3333bb6ac110d481f1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::meta::cluster_info::source_split_info (cognitive 38): risingwave_ctl::cmd_impl::meta::cluster_info::source_split_info has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 6 (12 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":"src/ctl/src/cmd_impl/meta/cluster_info.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65954ba4ec862ee0084378ff2575903ab568ed97a3faa08f98d673c5a3b2ac7"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::scalar::jsonb_set::jsonbb_set_path (cognitive 38): risingwave_expr_impl::scalar::jsonb_set::jsonbb_set_path has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/jsonb_set.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4611d93204b0e9d054be8f1f470320d5522a9252d92a276788e8593c78a64071"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaJoinSolver::find_lookup_path (cognitive 38): DeltaJoinSolver::find_lookup_path has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 8 (16 pts), boolean chains 2 (nesting depth added 20). Of this number, 33 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":"src/frontend/src/optimizer/delta_join_solver.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bd57ab70d55da6691ea321307b28c11c40d185172ab537249e3b98560c6340"}},{"ruleId":"D2","level":"warning","message":{"text":"InflightDatabaseInfo::apply_collected_command (cognitive 38): InflightDatabaseInfo::apply_collected_command has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 4 (5 pts), match/switch 2 (4 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":"src/meta/src/barrier/info.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78ce0b4b0a09a74f95c571a1fe6fd1febef875b07956c3dc7274d987450d572"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergCompactionManager::apply_sink_update (cognitive 38): IcebergCompactionManager::apply_sink_update has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 5, 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":"src/meta/src/manager/iceberg_compaction/schedule.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1ea213506879641246d601d81091b1e366051c9a9393446934e227dbcaadc6"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::local_version::pinned_version::start_pinned_version_worker (cognitive 38): risingwave_storage::hummock::local_version::pinned_version::start_pinned_version_worker has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 4 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/storage/src/hummock/local_version/pinned_version.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a75289f0b5d8930bb9d21f939d3b53145395d4a9d4f2e97d4d09312b4cb2bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkExecutor::execute_write_log (cognitive 38): SinkExecutor::execute_write_log has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (28 pts), match/switch 2 (6 pts), boolean chains 3, 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":"src/stream/src/executor/sink.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"54429fd231b8dd4e868a81d034454987beca7fac73ada6e1797e1dcef7e6e0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorWithDelta::move_impl (cognitive 38): CursorWithDelta::move_impl has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/delta_btree_map/src/lib.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e48c074517bd954c85e037cd9a77742f5b3a59810501744d2e37998f4bef36"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common_proc_macro::session_config::derive_config (cognitive 37): risingwave_common_proc_macro::session_config::derive_config has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 2 (3 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":"src/common/proc_macro/src/session_config.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"953f34ffd5cc37f4e53582161bcc96247b7400bac4a530aa2387373fcd0104b6"}},{"ruleId":"D2","level":"warning","message":{"text":"DatagenEventGenerator::into_native_stream (cognitive 37): DatagenEventGenerator::into_native_stream has cognitive complexity 37 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 2 (11 pts), loops 4 (10 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":"src/connector/src/source/datagen/source/generator.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2c459e064a0669503c70f2e925a2c0465e5a1e6f61e66a753031fcd7ba35b8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionAttr::generate_agg_build_fn (cognitive 37): FunctionAttr::generate_agg_build_fn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (21 pts), match/switch 8 (11 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/macro/src/gen.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"471a20cb66c4cbecee4f435e1b34f36994edd9e6cc49280dd788d96702f6a0ce"}},{"ruleId":"D2","level":"warning","message":{"text":"TableFunction::new_file_scan (cognitive 37): TableFunction::new_file_scan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 6 (11 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/table_function.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c40194e0be8bdd86135d2984a18283d60fe84c6e86b63ab5773eb30eda16ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendObserverNode::handle_catalog_notification (cognitive 37): FrontendObserverNode::handle_catalog_notification has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 18 (24 pts), if/else 4 (11 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/observer/observer_manager.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08e16d55a62908d8359bda12a9de9bd53ae47181ab6b1bb2bd27934da5b27e6"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalMultiJoin::as_bushy_tree_join (cognitive 37): LogicalMultiJoin::as_bushy_tree_join has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f440754071c9e30c0ce2ac38205bd51efb81a353a135e6ef3286b4c11f7e08"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::plan_iceberg_table (cognitive 37): Planner::plan_iceberg_table has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (26 pts), match/switch 4 (6 pts), boolean chains 4, loops 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":"src/frontend/src/planner/relation.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"946f7d635285c42c25c9fff69518b75c21349945adb001878d0055b25803722f"}},{"ruleId":"D2","level":"warning","message":{"text":"Condition::split_to_scan_ranges (cognitive 37): Condition::split_to_scan_ranges has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 3 (7 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662947a7241844a72afc06607f3649cd14c9f6e771776b534ba02052047edd9"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_backup::meta_snapshot_v2::encode_metadata_to_writer (cognitive 37): risingwave_backup::meta_snapshot_v2::encode_metadata_to_writer has cognitive complexity 37 (threshold 15). Drivers by points: if/else 37. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (risingwave_backup::meta_snapshot_v2::decode_metadata_from_reader) 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":"src/storage/backup/src/meta_snapshot_v2.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dddcb1cf179505274a3fc4d1e0f03f02d0a394b3ed05822b7d0430d4c351853"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_backup::meta_snapshot_v2::decode_metadata_from_reader (cognitive 37): risingwave_backup::meta_snapshot_v2::decode_metadata_from_reader has cognitive complexity 37 (threshold 15). Drivers by points: if/else 37. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (risingwave_backup::meta_snapshot_v2::encode_metadata_to_writer) 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":"src/storage/backup/src/meta_snapshot_v2.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeb104e6fc97d998b24270a2092198844297c717d5ae23880db9b0b19a54034"}},{"ruleId":"D2","level":"warning","message":{"text":"LogStoreRowOpStream::next_op (cognitive 37): LogStoreRowOpStream::next_op has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (11 pts), loops 3 (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":"src/stream/src/common/log_store_impl/kv_log_store/serde.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ca9a13e55be7aae17e00f909ebdb956bdda9820a9e2db3218ce8ee1b533d74"}},{"ruleId":"D2","level":"warning","message":{"text":"BeMessage::write (cognitive 37): BeMessage::write has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 7 (14 pts), loops 6 (13 pts), if/else 5 (10 pts) (nesting depth added 19). Of this number, 30 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_message.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b69c2e12a3323b98eb7f6bbbe97468469e2ac8b9b392414d6179de9137f9e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"fragment_graph.Streaming (cognitive 37): fragment_graph.Streaming has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (12 pts), boolean chains 5 (nesting depth added 16). Most of this is not in the body itself: 5 of the 37 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 299, 317, 262, \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":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc15d4021afb9070a584c986efa8be301b7a46ca3ffa80b87bb268ae5f189511"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common_proc_macro::estimate_size::extract_ignored_generics (cognitive 36): risingwave_common_proc_macro::estimate_size::extract_ignored_generics has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (9 pts), boolean chains 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/proc_macro/src/estimate_size.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3a8923d22d50c73b7f631dbdcc443d3cbc8d94b8811296aa58088f23c2718a"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::system_param::derive_missing_fields (cognitive 36): risingwave_common::system_param::derive_missing_fields has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 18, if/else 18. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/system_param/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"61494390c36f72b3fb260f19e150001bc49212fbe9da043c30cdef3b2053f4a6"}},{"ruleId":"D2","level":"warning","message":{"text":"AvroParseOptionsInner::convert_to_datum (cognitive 36): AvroParseOptionsInner::convert_to_datum has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 4 (7 pts), loops 3 (6 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/codec/src/decoder/avro/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11f1f71f6a1b1581e51cf960374344d2324e490d6eeaafc2cc39376bb2e7093"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionAttr::generate_build_scalar_function (cognitive 36): FunctionAttr::generate_build_scalar_function has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 13 (14 pts), boolean chains 4 (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/expr/macro/src/gen.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea339a77919fd582c3af3f7add5a00d9981f55184b07057b89235fd71a01c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_insert (cognitive 36): Binder::bind_insert has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 2, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/insert.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d14bdc83ebe6828a944253ac954f790d83e6b44d723799ccac8a3256cb6e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_table::create_iceberg_engine_table (cognitive 36): risingwave_frontend::handler::create_table::create_iceberg_engine_table has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 3 (11 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":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb5e06af3d0af6c1dd5e6cf8f370e9412a885a9382677dab3d327846d3420db"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::get_compact_tasks_impl (cognitive 36): HummockManager::get_compact_tasks_impl has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (8 pts), match/switch 2 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e7d95b44db40abc6103cea9ee6cfee6984172b163f011e837d4302169f66fc"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::truncate_time_travel_metadata (cognitive 36): HummockManager::truncate_time_travel_metadata has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 9 (12 pts) (nesting depth added 13). 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":"src/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcc0251228c6fd6c4e01c9942126e1bf1a740338e14fa8fbacd1cca74d3472e"}},{"ruleId":"D2","level":"warning","message":{"text":"Matches::try_match (cognitive 36): Matches::try_match has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (7 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":"src/meta/src/stream/stream_graph/state_match.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"871064570898194a58f1ff1ab5d368c53649219f3e2e70961336d6466882ad8e"}},{"ruleId":"D2","level":"warning","message":{"text":"OverPartition::find_affected_ranges_readonly (cognitive 36): OverPartition::find_affected_ranges_readonly has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 6, loops 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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"2356d350346fea3a16f03922e53d8c347eb316bfebf84d1cf21d2db05ef764c9"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::lookup::sides::align_barrier (cognitive 36): risingwave_stream::executor::lookup::sides::align_barrier has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 7 (19 pts), loops 6 (17 pts) (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/stream/src/executor/lookup/sides.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"826738cdd9aaac1bb637e26c8d31d0365ccd23eb6eaffa8a90d708065400c4f5"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::util::stream_graph_visitor::visit_stream_node_tables_inner (cognitive 35): risingwave_common::util::stream_graph_visitor::visit_stream_node_tables_inner has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 6 (11 pts), match/switch 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":"src/common/src/util/stream_graph_visitor.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb693e78c6689d68e81b2f0f24ec5c35f907f0df5d807abe5c20bad4e947c30"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_sink (cognitive 35): Parser::parse_alter_sink has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (32 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"524a15cab31aa6f476b31e15e324132236554d48ea2e466650d70ce96c7ea68c"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicFilterExecutor::apply_batch (cognitive 35): DynamicFilterExecutor::apply_batch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 3 (8 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":"src/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f62701966323a394d2627ae61774b3ec734920fc7790011c754c27e373189a"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchPosixFsListExecutor::into_stream (cognitive 35): BatchPosixFsListExecutor::into_stream has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 5 (22 pts), if/else 3 (11 pts), boolean chains 1, loops 1 (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/stream/src/executor/source/batch_source/batch_posix_fs_list.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"727df824d14c3833d682f439d990eb4a60a893f6ebc9fbcb8e4bf777de740ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedTopNState::init_topn_cache_inner (cognitive 35): ManagedTopNState::init_topn_cache_inner has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 5 (10 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":"src/stream/src/executor/top_n/top_n_state.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af3c0085c6b9f6403bc891a00faad0586714435c4f97ee0778985e0e3b50885"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.scan_direct_constructions (cognitive 35): extract.scan_direct_constructions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 3, boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"334818f860c417c272aec959926a1d7173100fb80f70a477b87e3e549c135aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatError::check_expr (cognitive 34): FormatError::check_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, 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":"lints/src/format_error.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a589dc89f9b9c96cf86c115b4d7c7761d86fb9f689ddb3cb1ba7916070e18f82"}},{"ruleId":"D2","level":"warning","message":{"text":"SortExecutor::do_execute (cognitive 34): SortExecutor::do_execute has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 7 (12 pts), boolean chains 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":"src/batch/executors/src/executor/order_by.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7e4a49f802af7baba921a0384338dda983dbb0b18fc8c83ca7e5461297c2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetParser::convert_record_batch_to_stream_chunk (cognitive 34): ParquetParser::convert_record_batch_to_stream_chunk has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (7 pts), match/switch 2 (7 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":"src/connector/src/parser/parquet_parser.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7448b2e0ac56c3d6d4d5e884bcacc712c7af7c8c87890be5d09f0c6395395cd"}},{"ruleId":"D2","level":"warning","message":{"text":"DatagenEventGenerator::into_msg_stream (cognitive 34): DatagenEventGenerator::into_msg_stream has cognitive complexity 34 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (11 pts), match/switch 2 (10 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":"src/connector/src/source/datagen/source/generator.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fda1bb57781c5908e1585b2054c3c5b56f5a5aa1299180819f6df8815645c5"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTimezone::with_timezone (cognitive 34): SessionTimezone::with_timezone has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 9, match/switch 3 (6 pts), loops 1 (2 pts) (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":"src/frontend/src/expr/session_timezone.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cb5e6b6abe7cd1e0718ccb9eade0d5352fbf33dada2d63d297c37a7534179b"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::alter_table_column::handle_alter_table_column (cognitive 34): risingwave_frontend::handler::alter_table_column::handle_alter_table_column has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 2 (6 pts), boolean chains 3, 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":"src/frontend/src/handler/alter_table_column.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b67d2fb60aac5b204cbf9a723743d4529d43571c964ba455ec4a60f36159b92"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::report_compact_tasks_impl (cognitive 34): HummockManager::report_compact_tasks_impl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 3 (7 pts), loops 3, 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":"src/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bd0a262a4fc27b33795cd9b6138e14d1a3b70b26afc41e9b0208b801b5a4a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ActiveStreamingWorkerNodes::changed (cognitive 34): ActiveStreamingWorkerNodes::changed has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 20). 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":"src/meta/src/manager/metadata.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd193a8861e502efcfb33fa5d5697448fbeca977be20d52505e6f8f8e1db468"}},{"ruleId":"D2","level":"warning","message":{"text":"DdlController::replace_job (cognitive 34): DdlController::replace_job has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (7 pts), match/switch 2, 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":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dfb64eb4b977badb805386102d1a91d1976112310953d2e7fd68c32703e3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalBarrierWorker::run (cognitive 34): LocalBarrierWorker::run has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 4 (12 pts), loops 2 (5 pts) (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/stream/src/task/barrier_worker/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c233c2ba19d1032e72d07cabd9a70719977591ec57f62506055e7fc3960aa"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.unescape_rust_string (cognitive 34): extract.unescape_rust_string has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37906df832063434f092cc3056be692aa5b970bd1ed54428bd65eb5aa9a42a1"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteLogSinker::consume_log_and_sink (cognitive 33): RemoteLogSinker::consume_log_and_sink has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (10 pts), loops 3, boolean chains 1 (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/remote.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f12ab934cd2c7669db8f04176beea1ce5869b21fc37a74ed2f481347863fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_join_constraint (cognitive 33): Binder::bind_join_constraint has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 4 (9 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/join.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b9ddb9a167b684d0235c641e38776ad6a7f0e1840539b076005d7b070abdad"}},{"ruleId":"D2","level":"warning","message":{"text":"NavExtractor::rewrite (cognitive 33): NavExtractor::rewrite has cognitive complexity 33 (threshold 15). Drivers by points: loops 11 (23 pts), if/else 3 (5 pts), match/switch 2 (4 pts), boolean chains 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7048db49a85dc5b67b9848d4af5fdccc45119c8ddcea944bdf42e1adf502df"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialGraphRecoverer::inject_database_initial_barrier (cognitive 33): PartialGraphRecoverer::inject_database_initial_barrier has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 10 (13 pts) (nesting depth added 10). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/rpc.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc47b9536e31a38bccd3ede555215f8a4dc7b87e8da788b040ac910e1b7df62e"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlStreamManager::poll_next_event (cognitive 33): ControlStreamManager::poll_next_event has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 5 (13 pts), boolean chains 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":"src/meta/src/barrier/rpc.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"defa2c75b616333f31b7fb5de1dc4dd00ea53a6068a32898da0dbea110cfb97d"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::commit_epoch (cognitive 33): HummockManager::commit_epoch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (19 pts), loops 9 (13 pts), boolean chains 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":"src/meta/src/hummock/manager/commit_epoch.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9bf64588ece5e4904ed9c42a5f0ecb020b83e77774bd749e0aae6f4d27cb32"}},{"ruleId":"D2","level":"warning","message":{"text":"DdlController::create_streaming_job (cognitive 33): DdlController::create_streaming_job has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 4, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e44213d1f3e1c74bb47a5c237b53d0ccd226bca94db867a084bcd569e25d933"}},{"ruleId":"D2","level":"warning","message":{"text":"CompleteStreamFragmentGraph::build_helper (cognitive 33): CompleteStreamFragmentGraph::build_helper has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (11 pts), loops 3 (7 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfb63c04dbd5e7ae48fbbd46507365520398b1027ef2b8109a13dc822a20bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalStreamManager::run (cognitive 33): GlobalStreamManager::run has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 4 (15 pts), boolean chains 1, loops 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":"src/meta/src/stream/scale.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cce0f2f5ea0555de55f5086437c723c04428c002c29a5ecd7a42a73f8cbbe83"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_source (cognitive 33): Parser::parse_alter_source has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23 (31 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"4722d0a2eead760f423d9b3af439ee7e2060d111a7184f9f288c95583fbc6739"}},{"ruleId":"D2","level":"warning","message":{"text":"TableWatermarksIndex::rewrite_range_with_table_watermark (cognitive 33): TableWatermarksIndex::rewrite_range_with_table_watermark has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 5 (16 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":"src/storage/hummock_sdk/src/table_watermark.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4790bab37eba629e50677c2337bf8c18a4adda4c7def22ab571eeb0ee1b9dd42"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::handle_watermark (cognitive 33): HashJoinExecutor::handle_watermark has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37857407916c3391a251090cd10df169da1b768dba7f11bec7bf43c810da9af"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupExecutor::execute_inner (cognitive 33): LookupExecutor::execute_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (14 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":"src/stream/src/executor/lookup/impl_.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"735a5a4d64f97dc8ad8ca2091f7932e3764c7165e12a30f448086f7c06d5f30c"}},{"ruleId":"D2","level":"warning","message":{"text":"Nfa::walk (cognitive 33): Nfa::walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (27 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":"src/stream/src/executor/match_recognize/nfa.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac84060cb5108d2a324efc2f4753211d7cedf856cf3c77507b69d5f2e4bc9b84"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncedKvLogStoreExecutor::execute_inner (cognitive 33): SyncedKvLogStoreExecutor::execute_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (9 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":"src/stream/src/executor/sync_kv_log_store.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"73547107fc88e744188333ae385ffc53fbc4bbed0391e4d92a11d9db833bd1b2"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_issue_tracker.find_tracking_issues (cognitive 33): doc_issue_tracker.find_tracking_issues has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (9 pts), boolean chains 4, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/doc_issue_tracker.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"960a4ede4209fa5944ce00d387004f0e747cddff8807dc287b831127ae0075f6"}},{"ruleId":"D2","level":"warning","message":{"text":"StageRunner::schedule_tasks (cognitive 32): StageRunner::schedule_tasks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (10 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c6543621556b3ba60b658ac65da999c013f79175500530aa98d07ac8d19e28"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::clean_dirty_sink_downstreams (cognitive 32): CatalogController::clean_dirty_sink_downstreams has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (4 pts), match/switch 1 (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":"src/meta/src/controller/catalog/util.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9539385913a5d73c0c0d6371d469818075d73cc5aced4123f107c7d056ab87ba"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::try_abort_creating_streaming_job (cognitive 32): CatalogController::try_abort_creating_streaming_job has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9d5b8ee3f837ebafec071cddf214c783a7f3bd1c5b72db72b42f3f5e7248df"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::filter_out_objects_by_time_travel (cognitive 32): HummockManager::filter_out_objects_by_time_travel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 6 (12 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":"src/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1eb90faa3b5ae11641d990720b3ff9dbbd723d298c8fb47b65caaf65bf0841"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectorSourceWorker::run (cognitive 32): ConnectorSourceWorker::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/source_manager/worker.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70b7f43f59454a36068f8fd526433b0d7c4ecd44c57520d4317d47a438ea509"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_hummock_sdk::compaction_group::hummock_version_ext::validate_version (cognitive 32): risingwave_hummock_sdk::compaction_group::hummock_version_ext::validate_version has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2823367233887fff732ca93298ed8367692c9340bf54f9da9399c3d63afdf95"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::shared_buffer_compact::compact_shared_buffer (cognitive 32): risingwave_storage::hummock::compactor::shared_buffer_compact::compact_shared_buffer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 6 (12 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":"src/storage/src/hummock/compactor/shared_buffer_compact.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"56991dd3d8fce104c23f9965f95d2c31eb901a8dbfb59496503407ce72a619b1"}},{"ruleId":"D2","level":"warning","message":{"text":"EowcGapFillExecutor::execute_inner (cognitive 32): EowcGapFillExecutor::execute_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (9 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":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cf9a76ab438d49f489d64cc0594c69576bd99cef0b88c8700a11580f4b77d2"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupUnionExecutor::execute_inner (cognitive 32): LookupUnionExecutor::execute_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (9 pts), match/switch 2 (8 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":"src/stream/src/executor/lookup_union.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48c94c8ea7aca9ddbc20aedd20ce09737e93dd55e5201ae2751533104032910"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::backfill::snapshot_backfill::executor::make_consume_snapshot_stream (cognitive 32): risingwave_stream::executor::backfill::snapshot_backfill::executor::make_consume_snapshot_stream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 16). 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, split the body into named stages: move each independent step or branch into 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/stream/src/executor/backfill/snapshot_backfill/executor.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b6d7bb0d35383c131160303f00d87ef536a3ecb5b082e93d725e95fc046e11"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::iceberg::metadata::scan_iceberg_metadata (cognitive 31): risingwave_connector::sink::iceberg::metadata::scan_iceberg_metadata has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (12 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/metadata.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4c2e26034e393596a46fe06aa268d6464207baa3a511cb1a074f4f64824ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"PullUpHopRule::apply (cognitive 31): PullUpHopRule::apply has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (22 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, and where an else follows 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/frontend/src/optimizer/rule/pull_up_hop_rule.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9684bb180af5a431b40c6e9e100205b8cc049fead97976dcf8f6920ff4c6702"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::alter_owner::handle_alter_owner (cognitive 31): risingwave_frontend::handler::alter_owner::handle_alter_owner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 1 (3 pts), 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":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2066cdf5ed6003933193b3ddc568e26382fd01d900bb5c1f20d819862cabb1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::webhook::websocket::try_handle_connection (cognitive 31): risingwave_frontend::webhook::websocket::try_handle_connection has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 4 (10 pts), boolean chains 1, 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":"src/frontend/src/webhook/websocket.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80d83b7a62b2ae6151ebf1956d9081e0e25fafa1d250ffb020d4e2b6256f5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::validate::validate_compatibility (cognitive 31): risingwave_frontend::handler::create_source::validate::validate_compatibility has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, 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":"src/frontend/src/handler/create_source/validate.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6e901acf8cac79c24c10e4d24b50871b258355b0cf7fb2349073b8c485196c"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::utils::iceberg_predicate::rw_expr_to_iceberg_predicate (cognitive 31): risingwave_frontend::utils::iceberg_predicate::rw_expr_to_iceberg_predicate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 6 (12 pts), loops 1 (4 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/iceberg_predicate.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9908de8af24da3728e2f922b15dafc4d12173f2f38768bac84d94fae1091007"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseCheckpointControl::next_complete_barrier_task (cognitive 31): DatabaseCheckpointControl::next_complete_barrier_task has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aa3ca616425bcda8c4b8cc5657ce6b32e704f593eb9704c606411e350c8087"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceManagerCore::drop_source_fragments (cognitive 31): SourceManagerCore::drop_source_fragments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), 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":"src/meta/src/stream/source_manager.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1aa917f5fbe5381a5fb7bdedf2778aefb3eb1992629a245544c5ef258c98a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::schedule (cognitive 31): Scheduler::schedule has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (9 pts), loops 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/schedule.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d6de69e1527f8bcdc1342d52379d08aecb1448d641f7775734b6c0a16203d"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferChunks::poll_next (cognitive 31): BufferChunks::poll_next has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/merge.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f560e7c1d76922dc33e2c4f0aaf7ce715d26b6d085a2302147fb608b6a1e7dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicReceivers::poll_next (cognitive 31): DynamicReceivers::poll_next has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mod.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6b55c2c0f14d983ecac239192b70190467cba0ebda56b8c985c38e83ad7f26"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchIcebergListExecutor::into_stream (cognitive 31): BatchIcebergListExecutor::into_stream has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 4 (14 pts), boolean chains 1, 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":"src/stream/src/executor/source/batch_source/batch_iceberg_list.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9686c7aaf2985602b51b29c2831227af9c59169cb02a62c6213fd1efde87e11"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamReaderBuilder::into_retry_stream (cognitive 31): StreamReaderBuilder::into_retry_stream has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/reader_stream.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd5e707e7aec15d27fe3409ef8dfa79be051c4409158666665b247eda5e2079"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::lookup::sides::stream_lookup_arrange_this_epoch (cognitive 31): risingwave_stream::executor::lookup::sides::stream_lookup_arrange_this_epoch has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (18 pts), match/switch 4 (13 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/lookup/sides.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fb22a74f688be65671ce562c601472627c91684a7281b5ca9552d8f7236558"}},{"ruleId":"D2","level":"warning","message":{"text":"JDBCSink.write (cognitive 31): JDBCSink.write has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), error handling 2 (5 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":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"674e6bac66af072f4488a7eb81b24f60d487a93bb8fd834efba24a2308d07bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"MonitorServiceImpl::get_streaming_stats (cognitive 30): MonitorServiceImpl::get_streaming_stats has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 7 (8 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/rpc/service/monitor_service.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26b37fcadb1797fcfc55b212268fb8600327267a7ac108258e441901fbcae34"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarAdapter::into_scalar (cognitive 30): ScalarAdapter::into_scalar has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (12 pts), loops 3 (6 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/scalar_adapter.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e3660bd0d392eff8587125c6a8a8a7d19656a59c6b127b62dc768b476ac901"}},{"ruleId":"D2","level":"warning","message":{"text":"ClickHouseFieldWithNull::from_scalar_ref (cognitive 30): ClickHouseFieldWithNull::from_scalar_ref has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/clickhouse.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"70758a91277e09ff4b192aab61e02716c40ef58453bfb57945621711fe93c21f"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::hummock::compaction_group::build_compaction_config_vec (cognitive 30): risingwave_ctl::cmd_impl::hummock::compaction_group::build_compaction_config_vec has cognitive complexity 30 (threshold 15). Drivers by points: if/else 30. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named 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/ctl/src/cmd_impl/hummock/compaction_group.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad692f339f19a4e17de0ebb45a0333277635b381acc072c79af2cd6fdd0d49c8"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::hummock::sst_dump::sst_dump (cognitive 30): risingwave_ctl::cmd_impl::hummock::sst_dump::sst_dump has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (8 pts), match/switch 1 (4 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":"src/ctl/src/cmd_impl/hummock/sst_dump.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"438de84861978693df40f19ddf3bb1761122b7f1d32b40d87e28ea8dcd7fa87a"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::meta::reschedule::unregister_workers (cognitive 30): risingwave_ctl::cmd_impl::meta::reschedule::unregister_workers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (5 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/meta/reschedule.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"774c0d58195b89fcc2d53c275a53b25a8618546a5317cdfca490acbee96f3d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergIntermediateScanRule::apply (cognitive 30): IcebergIntermediateScanRule::apply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 3 (6 pts), loops 2 (4 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, and where an else follows 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/frontend/src/optimizer/rule/iceberg_intermediate_scan_rule.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad8636d68c028f8846962f4fdef8889d834efe3bf5c86f50276e6e60f79ee90"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterArithmeticRewriter::simplify_arithmetic_comparison (cognitive 30): FilterArithmeticRewriter::simplify_arithmetic_comparison has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/over_window_to_topn_rule.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"021cc143000777f35fccc4f8b338c56be2e9d7e27b3e9f592afe13116c2ef12d"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::create_job_catalog (cognitive 30): CatalogController::create_job_catalog has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"de05dad0159b9ff3222e7149bd5f01341c3161ab01b86c9cc6a7dbe4e02e315a"}},{"ruleId":"D2","level":"warning","message":{"text":"LevelCompactionPicker::pick_multi_level_to_base (cognitive 30): LevelCompactionPicker::pick_multi_level_to_base has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (9 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":"src/meta/src/hummock/compaction/picker/base_level_compaction_picker.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1057cf532c8e845de05a28ef248aa003bb78fe9a54db01b59931e9d5f019d78"}},{"ruleId":"D2","level":"warning","message":{"text":"MinOverlappingPicker::pick_tables (cognitive 30): MinOverlappingPicker::pick_tables has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (11 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":"src/meta/src/hummock/compaction/picker/min_overlap_compaction_picker.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b51fab253d370b0733a0d44b940d47c8e581f64f2aa664c7f2e10555c7371f"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlBackendElectionClient::run_once (cognitive 30): SqlBackendElectionClient::run_once has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 2 (4 pts), loops 2, 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":"src/meta/src/rpc/election/sql.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a066a99f21f0022992fb589e333bce479823db5fe1e58ddcede48036a92e58d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::tokenize_dollar_preceded_value (cognitive 30): Tokenizer::tokenize_dollar_preceded_value has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (14 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":"src/sqlparser/src/tokenizer.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c67a56e45595341bb06148cec3a854b4c21ffca4d7ff3e6fb8610b14b5a889e"}},{"ruleId":"D2","level":"warning","message":{"text":"SstableStore::prefetch_blocks (cognitive 30): SstableStore::prefetch_blocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 2 (3 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":"src/storage/src/hummock/sstable_store.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a08c8f4a0c8db50e88065c1fa98ab639f17e71826dc767bf7997752406d822"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockReadVersion::update (cognitive 30): HummockReadVersion::update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"79adc44e6fb4be3ab27033d2cb897ee217278dcddcec218dd61fdfb7363e1421"}},{"ruleId":"D2","level":"warning","message":{"text":"pgwire::pg_protocol::parse_options (cognitive 30): pgwire::pg_protocol::parse_options has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f3bf36c0c6b68535b137e314638a248733818a651eb5eff3f414273cb080a0"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_rt::logger::init_risingwave_logger (cognitive 30): risingwave_rt::logger::init_risingwave_logger has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 4 (7 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":"src/utils/runtime/src/logger.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5365fd2c5183ecaa78bcc24c0ce0f57cbc157ea3d1a3a37ba976492aa4fb28ca"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::encoder::json::datum_to_json_object (cognitive 29): risingwave_connector::sink::encoder::json::datum_to_json_object has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 9 (16 pts), loops 4 (10 pts), if/else 2 (3 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/encoder/json.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf96eab91b3363364f8807301fff85a4fa2418148f45c0cb8e1f4e0d4ddfa5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_window_function (cognitive 29): Binder::bind_window_function has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 5 (11 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":"src/frontend/src/binder/expr/function/window.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d977671ec7fab6677fe086c5dc8d1504b55dba572f0bd850019690757a2b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_update (cognitive 29): Binder::bind_update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (11 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/update.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e649ca6d96f17bc3d12f5271da2bef3a8bc49af2775fcd6e37add0c300cf4a40"}},{"ruleId":"D2","level":"warning","message":{"text":"PullUpCorrelatedPredicateAggRule::apply (cognitive 29): PullUpCorrelatedPredicateAggRule::apply has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (24 pts), loops 3, 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":"src/frontend/src/optimizer/rule/pull_up_correlated_predicate_agg_rule.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba6ffa874b8e6848049db04a673543080f3757fd6697fb58a5bd22368580822"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::reschedule_to_mutation (cognitive 29): Command::reschedule_to_mutation has cognitive complexity 29 (threshold 15). Drivers by points: loops 10 (18 pts), if/else 4 (11 pts) (nesting depth added 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":"src/meta/src/barrier/command.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f950962d3cecb59feb8ca9df53872b966c1cfb23d56b3f5be01d3aeb19dfdc5"}},{"ruleId":"D2","level":"warning","message":{"text":"PostCollectCommand::post_collect (cognitive 29): PostCollectCommand::post_collect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (6 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/context/context_impl.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ecee5e45ba11826950ffa13c09abab08811b97d53544843bf43dd5b087f01"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::merge_compaction_group_impl (cognitive 29): HummockManager::merge_compaction_group_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (23 pts), loops 3, 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, and where an else follows 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/meta/src/hummock/manager/compaction/compaction_group_schedule/topology.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e473e80b2f9d47c0e0907b9b16904290c9f1a1f9f96d74e7479bd137e0f674"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_format_encode_with_connector (cognitive 29): Parser::parse_format_encode_with_connector has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/ast/statement.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00cf83ac9859b477a290478aa45835f85feed850098bf7de4536a06f0fc8955"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_create_table (cognitive 29): Parser::parse_create_table has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21 (27 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"962553d2e322c5db9bccc5ddc062254a3ddc394f9131c7e56f6eb787805dee63"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_index (cognitive 29): Parser::parse_alter_index has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (26 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"575e91c7ac050c9705109ac94281783b98ad3899ffe68b01a016a9bd9f3e7b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_hummock_sdk::compaction_group::group_split::split_sst_info_for_level_v2 (cognitive 29): risingwave_hummock_sdk::compaction_group::group_split::split_sst_info_for_level_v2 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 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":"src/storage/hummock_sdk/src/compaction_group/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"277e3240c9fb4e0d2d4c328ad4ec6c5b0f08ab47915d8ddaf44852ab88701daa"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchTableInnerIterInner::into_stream (cognitive 29): BatchTableInnerIterInner::into_stream has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (8 pts), match/switch 3 (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":"src/storage/src/table/batch_table/mod.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"878e989ed7180a6d591a26f855cf61ce410d4fa7c4d59fcac51bf2486cafdd48"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalApproxPercentileExecutor::execute_inner (cognitive 29): LocalApproxPercentileExecutor::execute_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (9 pts), loops 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/approx_percentile/local.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a9bbf22e7551e186dccba1c9311c5870ba8a6b107b563028168ef8a8a88dae"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::handle_match_rows (cognitive 29): HashJoinExecutor::handle_match_rows has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (5 pts), match/switch 4 (5 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":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"f377d92d916f698e150aedf4e6949c0fa1452d65bcef8f856d567a6bfb20fb62"}},{"ruleId":"D2","level":"warning","message":{"text":"OverWindowExecutor::executor_inner (cognitive 29): OverWindowExecutor::executor_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (8 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":"src/stream/src/executor/over_window/general.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"255c5499fd7014ad126b378e40c64549472ee813bd4cc43c1fe44ef9000c94dc"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::common::log_store_impl::kv_log_store::serde::stream_de::may_merge_update (cognitive 29): risingwave_stream::common::log_store_impl::kv_log_store::serde::stream_de::may_merge_update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (28 pts), 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":"src/stream/src/common/log_store_impl/kv_log_store/serde.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a82ed7494be8f4ac2b7f9ac2ad9d78dc5161e5132dfc4d5579892fc1c65e0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanRange::range_overlap_check (cognitive 28): ScanRange::range_overlap_check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 5 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/scan_range.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a6a31aa8b74b1876cc169e242e685129df6622a8c48ee17e1b854af57e7ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalMultiJoin::heuristic_ordering (cognitive 28): LogicalMultiJoin::heuristic_ordering has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"97239c97014751ec81a8d9899c058fc3482e75750cdc5ba62eaaa69df3af5ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseCheckpointControl::handle_new_barrier (cognitive 28): DatabaseCheckpointControl::handle_new_barrier has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df53f448e1d3cc73477635ec7d7266417bd6a0dd51cef03bd3d0be3c4c28fab"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::finish_replace_streaming_job_inner (cognitive 28): CatalogController::finish_replace_streaming_job_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6 (10 pts), boolean chains 3, match/switch 2 (nesting depth added 9). 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, split the body into named stages: move each independent step or branch into 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ecc1514f5eff0cdcedc6cf9d4e43c6d1bb1b7fc4161d59b33df99e365307b3"}},{"ruleId":"D2","level":"warning","message":{"text":"TombstoneReclaimCompactionPicker::pick_compaction (cognitive 28): TombstoneReclaimCompactionPicker::pick_compaction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/picker/tombstone_reclaim_compaction_picker.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"43783574945851cb5aacb4b0a8652770cecd5d825f5a5ecbf45e7ad35d215af9"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildingFragment::fill_job (cognitive 28): BuildingFragment::fill_job has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a635f814c15a5887ff2872961819b5b1ac3e40bbe133dfb0bb0585eec1b524"}},{"ruleId":"D2","level":"warning","message":{"text":"S3ObjectStore::configure_bucket_lifecycle (cognitive 28): S3ObjectStore::configure_bucket_lifecycle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (4 pts), boolean chains 2, 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":"src/object_store/src/object/s3.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"2960568148b7dc55bffb52465cf8ca6dd32f4f6c9b28fbd608d4ad214d12ec73"}},{"ruleId":"D2","level":"warning","message":{"text":"risedev_config::main (cognitive 28): risedev_config::main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 4 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/config/src/main.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea0f2d871ceb0394a0f6d78ebf397e608706c61aff766bfde4589801bae3bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"TableWatermarksIndex::filter_regress_watermarks (cognitive 28): TableWatermarksIndex::filter_regress_watermarks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (6 pts), match/switch 1 (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":"src/storage/hummock_sdk/src/table_watermark.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d716d0e4edd18f18848e3f97310ad87f77af1d01db9792a48dc97cf75fcaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchTableInner::get_row (cognitive 28): BatchTableInner::get_row has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (7 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/table/batch_table/mod.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261079d06c89017687eff64f82bd574aa3e3908b16e3954ade69ecb381c4204"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchRecognizeExecutor::emit_ready (cognitive 28): MatchRecognizeExecutor::emit_ready has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (6 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":"src/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c93ab2401c7c2269babd28d9b2ce89bead81a3e5dfbab94b800ac1d4a8b3dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializeExecutor::make_mergesort_stream (cognitive 28): MaterializeExecutor::make_mergesort_stream has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mview/materialize.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"67254a96f7478382876df2d302c395f5d11b3ebd3b6f58a00d04bcfd5f619110"}},{"ruleId":"D2","level":"warning","message":{"text":"OverPartition::clean_stale_rows (cognitive 28): OverPartition::clean_stale_rows has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (22 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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe6441629783453e6157e166f2f1987085061f175faaed3b8dbc0221fec74cd"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchAdbcSnowflakeListExecutor::into_stream (cognitive 28): BatchAdbcSnowflakeListExecutor::into_stream has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 3 (11 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"094313adb675575055b00158b607cfaf965187018c736eb5647d77deefbf0499"}},{"ruleId":"D2","level":"warning","message":{"text":"Decimal::checked_powd (cognitive 27): Decimal::checked_powd has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 2 (4 pts), boolean chains 2 (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":"src/common/src/types/decimal.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"66781fdbd2a788f397e2d15d5d7a3d9e6cc55bafbd26b595c00695c84b88a56d"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeV2Config::from_btreemap (cognitive 27): SnowflakeV2Config::from_btreemap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 7, 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":"src/connector/src/sink/snowflake_redshift/snowflake.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01476f3f279d6a13d7b200c433a011ea41c6ffa7d2a32b37a526bcbf1b2c18"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::alter_user::alter_prost_user_info (cognitive 27): risingwave_frontend::handler::alter_user::alter_prost_user_info has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, 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":"src/frontend/src/handler/alter_user.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b83716ad9b98d898ee0978e1b35003039400b30a4171d2765a343527636c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::utils::with_options::resolve_connection_ref_and_secret_ref (cognitive 27): risingwave_frontend::utils::with_options::resolve_connection_ref_and_secret_ref has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/with_options.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec0e034f3a40ee000b9c4654a8847daec65ecbe55907874d00a1112d1238bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::collect_database_partial_graph_actor_upstreams (cognitive 27): Command::collect_database_partial_graph_actor_upstreams has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/command.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"7418375cbae2406c9eb1264693fe1288cda9eca056240fb01d7c782368878d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::update_fragment_rate_limit_by_fragment_id (cognitive 27): CatalogController::update_fragment_rate_limit_by_fragment_id has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 4 (9 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f60796c08788fcae7f397f3031ed39c477046579eb184ab0e48254e963a6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::revoke_privilege (cognitive 27): CatalogController::revoke_privilege has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/user.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"708612bfb4abd34392acdda2ed58fe8bf09bcb9c1da369f67e3362ededf1306f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClusterControllerInner::add_worker (cognitive 27): ClusterControllerInner::add_worker has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 2 (5 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":"src/meta/src/controller/cluster.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac2b1ec3806426b3a9b18d749ac37f6df4292cedbb675198f4e22b4fa55afb5"}},{"ruleId":"D2","level":"warning","message":{"text":"IntraCompactionPicker::pick_l0_intra (cognitive 27): IntraCompactionPicker::pick_l0_intra has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (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":"src/meta/src/hummock/compaction/picker/intra_compaction_picker.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"504cbdf380d4e7bf3cf62c35aeeee0159524d15f71738ea0aa4d0cb644524fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactionEventLoop::run (cognitive 27): CompactionEventLoop::run 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":"src/meta/src/hummock/manager/compaction/compaction_event_loop.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b45c9837fd713997831b3d1e426327df02920e10ed95d8c3a9c284d15d266c"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::unescape_c_style (cognitive 27): Tokenizer::unescape_c_style has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (7 pts), boolean chains 4, loops 3 (nesting depth added 8). 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 items inside it that branch (hex_byte_process, octal_byte_process). 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":"src/sqlparser/src/tokenizer.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c03f5b093909d7e8d82d24452955156f41b20d08a0877f3057e94416625f985"}},{"ruleId":"D2","level":"warning","message":{"text":"BackwardUserIterator::next (cognitive 27): BackwardUserIterator::next has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 1 (3 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":"src/storage/src/hummock/iterator/backward_user.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e5c205637f7b3d7c740289f1ecb40ecb593fb322fcaa6caa0455cc8d719bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"HashAggExecutor::flush_data (cognitive 27): HashAggExecutor::flush_data has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 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":"src/stream/src/executor/aggregate/hash_agg.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22f2554ea8f89d7be940d33f19055f1f5e7f90675ba82f0932bf6bff0344ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"CdcBackfillExecutor::consume_upstream_chunk_buffer (cognitive 27): CdcBackfillExecutor::consume_upstream_chunk_buffer has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), 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":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e06ff31287360f7907f5c12c39736479c3dc5e13851a2f9dbf64403bfb4d074"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchOpendalFsListExecutor::into_stream (cognitive 27): BatchOpendalFsListExecutor::into_stream has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 2 (10 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed98a9a80ba6221020890b75d73a4cca6fa1aee9a629e7417904af13264414f"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceExecutorBuilder::new_boxed_executor (cognitive 27): SourceExecutorBuilder::new_boxed_executor has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (24 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":"src/stream/src/from_proto/source/trad_source.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"82669fee1525b89815d66d98b2483912d1ca32723ef47c673f83d7a8df3f9446"}},{"ruleId":"D2","level":"warning","message":{"text":"RelationGraph.RelationGraph (cognitive 27): RelationGraph.RelationGraph has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 8, boolean chains 3 (nesting depth added 3). Most of this is not in the body itself: 0 of the 27 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 255, 283, 175, \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":"dashboard/components/RelationGraph.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcc7a92f3f7f6322ea4f386b42fbe5225bd789697e2d4c1680f8fe7b4efa6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_inner_join (cognitive 26): HashJoinExecutor::do_inner_join has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e291f19f2db1226ea678973013ee5d70df5cb4c80109a2c5db17a73e4c0f94"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchTaskExecution::run (cognitive 26): BatchTaskExecution::run has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 3 (6 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/batch/src/task/task_execution.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7c53e6f687245a6031d64eb0d1eda2d0bea12c44a88b49b2bb4065ebde5a25"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaConnectionProps::set_security_properties (cognitive 26): KafkaConnectionProps::set_security_properties has cognitive complexity 26 (threshold 15). Drivers by points: if/else 26. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/common.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ce93650f0acf80316841ecc29f2e6a849fc35378b224dc31b972789af25800"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergConfig::from_btreemap (cognitive 26): IcebergConfig::from_btreemap has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/config.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72fb25fad5b9b3b6c0fecc83a889b2f438b9e9855e42b4bc768b58f4166367f"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalOptimizer::register_batch_mview_candidates (cognitive 26): LogicalOptimizer::register_batch_mview_candidates has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), 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":"src/frontend/src/optimizer/logical_optimization.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"07226a12db0dee25e84de873d5719b47aaea3bbebf125fc13235768a91455481"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::catalog::purify::try_purify_table_source_create_sql_ast (cognitive 26): risingwave_frontend::catalog::purify::try_purify_table_source_create_sql_ast has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/purify.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"391edaef10fd1cb131e299aabc2fb0bde8652ad6b8e8b9dfa8b3f88d5c11260b"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::external_schema::bind_columns_from_source_for_non_cdc (cognitive 26): risingwave_frontend::handler::create_source::external_schema::bind_columns_from_source_for_non_cdc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, match/switch 2 (nesting depth added 9). Of this number, 24 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":"src/frontend/src/handler/create_source/external_schema.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4a5f575b38f05b5369552c9d6f563cb8cf49ca30858a9dc958ff2a2e762ace"}},{"ruleId":"D2","level":"warning","message":{"text":"DdlServiceImpl::create_iceberg_table (cognitive 26): DdlServiceImpl::create_iceberg_table has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 pts), boolean chains 2, 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":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"b275a4cd381ae3ad7ac91f0bf5e3694ba91e2530fd6aea107227569eb6e221f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduledBarriers::mark_ready (cognitive 26): ScheduledBarriers::mark_ready has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 2, 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":"src/meta/src/barrier/schedule.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cbd5cfc420cc063b4c6f4e9b461bbbcb74f944718156547a13a61ebd882936"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceManagerCore::apply_source_change (cognitive 26): SourceManagerCore::apply_source_change has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (14 pts), if/else 5 (11 pts), match/switch 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":"src/meta/src/stream/source_manager.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d6e9e49968b68094950b8baab52273d566db2d137ece77bea84754e3d6fa3f"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::stream::stream_graph::state_match::match_graph::dfs (cognitive 26): risingwave_meta::stream::stream_graph::state_match::match_graph::dfs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/state_match.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29bf1b8a01a2a5a96d2b570697ce652b69f0c7d60f4ae1b0757e749b8e0bc3b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactorRunner::merge_inputs (cognitive 26): CompactorRunner::merge_inputs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 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":"src/storage/src/hummock/compactor/fast_compactor_runner.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"007a9ea1ffbbc1f5f30951b7f1e102699f13f726047ce91485fe790c9e4cf2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::build_task_planning_config (cognitive 26): risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::build_task_planning_config has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"49143df2e84342403005eb2873c81a891b290a71f012895e942fa7723d5445d4"}},{"ruleId":"D2","level":"warning","message":{"text":"EowcOverWindowExecutor::apply_chunk (cognitive 26): EowcOverWindowExecutor::apply_chunk has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/eowc.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b2e955a21decd52ed0fba6e9f6c44b3c11ec2261e5debaeaf705296452dc31"}},{"ruleId":"D2","level":"warning","message":{"text":"EowcOverWindowExecutor::executor_inner (cognitive 26): EowcOverWindowExecutor::executor_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 3, 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":"src/stream/src/executor/over_window/eowc.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3659ce016d8d2f8239e3ccb0e0c6c2d78540a80c2e9da146fc712b41523c69"}},{"ruleId":"D2","level":"warning","message":{"text":"PgCompositeToStringConverter.parsePgTextArray (cognitive 26): PgCompositeToStringConverter.parsePgTextArray has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/com/risingwave/connector/cdc/debezium/converters/PgCompositeToStringConverter.java"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1497aa77ca2f3ca2f5c6c298084a6f711bbbe30acf56992f5d83cfbcf4ff05"}},{"ruleId":"D2","level":"warning","message":{"text":"DataChunkMutator::remove_duplicate_rows_for_left_semi_anti_join (cognitive 25): DataChunkMutator::remove_duplicate_rows_for_left_semi_anti_join has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8016ae3577b129d835fd112a1e7350ec80b036bc80fa46fe8e1def84bda0bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"StackTraceResponseOutput::fmt (cognitive 25): StackTraceResponseOutput::fmt has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 8 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/prost.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aafc639251e2aed9a3be8680d7cd73750cd3e5303c8e9c7fdf27cc46a7fbbb"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::array::arrow::arrow_impl::is_parquet_schema_match_source_schema (cognitive 25): risingwave_common::array::arrow::arrow_impl::is_parquet_schema_match_source_schema has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/array/arrow/arrow_impl.rs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"435e2f28f94b351c5d86834a20589591d1abb5fcfad6d252909c66e60c8c7130"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::scalar::jsonb_delete::jsonbb_remove_path (cognitive 25): risingwave_expr_impl::scalar::jsonb_delete::jsonbb_remove_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 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":"src/expr/impl/src/scalar/jsonb_delete.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8b548a2e4f887f7b9e9b9763cff173ae62272e72db71fd655c81fa79783102"}},{"ruleId":"D2","level":"warning","message":{"text":"BooleanConstantFolding::rewrite_function_call (cognitive 25): BooleanConstantFolding::rewrite_function_call has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (24 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":"src/frontend/src/expr/utils.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01fba73f480d7ac3837c190d7c4dad3cae6d25f27c2928ef8f04afdfa290ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Join::stream_key (cognitive 25): Join::stream_key has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 4, 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":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf81148c6e2db22a24b3015857b3a5c8a0a0436cf69cbabb5bae53712ca1b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalJoin::to_batch_lookup_join_with_index_selection (cognitive 25): LogicalJoin::to_batch_lookup_join_with_index_selection has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (6 pts), loops 1 (2 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":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f12f38eb828ae14f93b89834b7e5ffaf753484d745d98d3937ae85733573b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchPlanFragmenter::new_stage (cognitive 25): BatchPlanFragmenter::new_stage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (23 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":"src/frontend/src/scheduler/plan_fragmenter.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dee06dc557896c1ec832ccabd62fa7859f0c0f700a716ba62da6e377c799c2"}},{"ruleId":"D2","level":"warning","message":{"text":"WholeLevelCompactionPicker::pick_whole_level (cognitive 25): WholeLevelCompactionPicker::pick_whole_level has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, 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":"src/meta/src/hummock/compaction/picker/intra_compaction_picker.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1ae95b65e90651c1702e1a281adc08cbd34dd1f74341bd723ab2a34914ca6b"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockCompactorDedicatedEventLoop::compact_task_dedicated_event_handler (cognitive 25): HummockCompactorDedicatedEventLoop::compact_task_dedicated_event_handler has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_event_loop.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1506ac67a7636468a80565c2afb4fb6116fc9b529c40e147e7e19dbe366c8330"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergPkIndexSinkCoordinator::resolve_compaction_overwrite_files (cognitive 25): IcebergPkIndexSinkCoordinator::resolve_compaction_overwrite_files has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/iceberg_pk_index_sink/coordinator.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8b2e0e1dc56454a81a2ca710d2741d10c9640463404c02dbe284a76ae94c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::hummock::metrics_utils::trigger_sst_stat (cognitive 25): risingwave_meta::hummock::metrics_utils::trigger_sst_stat has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (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":"src/meta/src/hummock/metrics_utils.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"73806dbc9f975141affe7e42ef03b9e44e6446364f269d629eaac229906503d9"}},{"ruleId":"D2","level":"warning","message":{"text":"DollarExpander::visit (cognitive 25): DollarExpander::visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (8 pts), match/switch 2 (6 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/config/dollar_expander.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7255eb7a06272803dd978465a3ab4850cb728b815e5f3097c280897b7af1ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"TableFactor::fmt (cognitive 25): TableFactor::fmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/ast/query.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0203c48526b1f78b3dd808593490261ad5161b96c460a1d9bf73382718fadba1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactTaskExecutor::run (cognitive 25): CompactTaskExecutor::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 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":"src/storage/src/hummock/compactor/fast_compactor_runner.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"16776a3e4d874056072cd42a37149f74e035c205e6c3d15bc21191fcad930d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalHummockStorage::flush (cognitive 25): LocalHummockStorage::flush has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/local_hummock_storage.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"83590a0415327c5b8335bb0a265a7a06246046552eaaf73485136ae8acb5213f"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::handle_match_row (cognitive 25): HashJoinExecutor::handle_match_row has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (4 pts), boolean chains 3, 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":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bba6e4774de7c2e220b4ac1d636b75a26bef7c6b60a1cbf0047b0adf818051b"}},{"ruleId":"D2","level":"warning","message":{"text":"TroublemakerExecutor::execute_inner (cognitive 25): TroublemakerExecutor::execute_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (9 pts), match/switch 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/troublemaker.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8080d1f9ab8cac02640c1a3e8b2d82f2f67b0caec0d731033eb9f8247463466"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateExecutor::do_execute (cognitive 24): UpdateExecutor::do_execute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/update.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa004f936bd86f13a6eeac5e2b0bdcdb52ba4e6b1747d09ae3b1376a2958d36"}},{"ruleId":"D2","level":"warning","message":{"text":"DataChunk::serialize (cognitive 24): DataChunk::serialize has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5 (10 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/array/data_chunk.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7396f2a7a392686a17bb9cd42dee46ce1141e6eb0110b3ebc5a78fb95338b8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector_codec::decoder::protobuf::parser::from_protobuf_value (cognitive 24): risingwave_connector_codec::decoder::protobuf::parser::from_protobuf_value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (7 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":"src/connector/codec/src/decoder/protobuf/parser.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7783538cfdd48a5a7eb8f4ccc6a86cebebe2dd3be750f6938b9515d28a53f382"}},{"ruleId":"D2","level":"warning","message":{"text":"ApproxPercentile::add_datum (cognitive 24): ApproxPercentile::add_datum has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 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":"src/expr/impl/src/aggregate/approx_percentile.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9579872a958711c8d11e7dc941c08c1f06960a5c41e28045a8defcfd5c8d87ec"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionWindow::recalculate_left_right (cognitive 24): SessionWindow::recalculate_left_right has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 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":"src/expr/impl/src/window_function/buffer.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d19639b3cc4dd7fa4c9349b0b10e184b937b0ba82fdd57f627ae787287517f"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergScanInner::execute_inner (cognitive 24): IcebergScanInner::execute_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/datafusion/iceberg_executor.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"349a009fe701a11594ea2de879b00a84727b0eb17f00e8135a9d593fce167cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalAgg::to_stream (cognitive 24): LogicalAgg::to_stream has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f8a76f01e5a3d2db4db716ef32577aa70d94a54fa779a21fcdcad30c76f5bc"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalJoin::simplify_outer (cognitive 24): LogicalJoin::simplify_outer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (5 pts), match/switch 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":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d217dc525a208ce97d6d1a4ab3f678b089f90e775942de5a6de506a54e4dbdf6"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalJoin::logical_rewrite_for_stream (cognitive 24): LogicalJoin::logical_rewrite_for_stream has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 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":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"757ae03b7644fd6db300ddbaa5760afea10a59ae720bfe1d1b6e6392b619cf6b"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalProject::to_stream_with_dist_required (cognitive 24): LogicalProject::to_stream_with_dist_required has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_project.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c377006461050bc6ef80488f43a32d501bb2d39d3117d8b87edc49cfdead32"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::plan_source (cognitive 24): Planner::plan_source has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, 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":"src/frontend/src/planner/relation.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0611976e8bf0f291241cdd18b20f39b0a069310eee5904c032fc9da44f95858"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionCursor::next_row (cognitive 24): SubscriptionCursor::next_row has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 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":"src/frontend/src/session/cursor_manager.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"171edc040c5e8b1187c21624778d89e35df714701b4e46fd8b145fa4a9fa583b"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionCursor::next (cognitive 24): SubscriptionCursor::next has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (5 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":"src/frontend/src/session/cursor_manager.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3976ca6c1988a045431e925c7f0288a0894ae4bc37d9486f9fa29922bf46b4c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionCursor::create_batch_plan_for_cursor (cognitive 24): SubscriptionCursor::create_batch_plan_for_cursor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/session/cursor_manager.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbcc4ef86864bd305787641c8429722b41ae665fd7ba94b4cc377b4741dddad"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::drop_user::handle_drop_user (cognitive 24): risingwave_frontend::handler::drop_user::handle_drop_user has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 1, 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":"src/frontend/src/handler/drop_user.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9a0cfdf95c36afa7fa5d0b16db3572122382df3a41e4d281fef3e4a3f22087"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::alter_set_schema::handle_alter_set_schema (cognitive 24): risingwave_frontend::handler::alter_set_schema::handle_alter_set_schema has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (3 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":"src/frontend/src/handler/alter_set_schema.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bfaac5f79d9ab8f814e57ba4b9c48869f103e3d088079106437d91406c34e9"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::cdc::parse_postgres_cdc_external_table_name (cognitive 24): risingwave_frontend::handler::cdc::parse_postgres_cdc_external_table_name has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 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":"src/frontend/src/handler/cdc.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ec1bbc9933e9c319d1625ed8a9c906cfa26c746d077c79f3dd3d7e4c8caa0"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointControl::next_event (cognitive 24): CheckpointControl::next_event has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf08a06a76dbb94fe87250e7ed2c281f7a9a0e8f12fbfc7d3a1fdb274a988675"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryRewriter::visit_set_expr (cognitive 24): QueryRewriter::visit_set_expr has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 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":"src/meta/src/controller/rename.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7910bee8b68c081db6f81f22d6cdb5666d8b56c038da682275003ff1ee020f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_database (cognitive 24): Parser::parse_alter_database has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4c3ea20fa8d139d1eadb3055fe93dc60e9a62f7f2d17547af3962e90d17e81"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_optional_pattern_quantifier (cognitive 24): Parser::parse_optional_pattern_quantifier has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":6023}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b685ebff6eea5652590bdfb6a760f6284ed811e2985b2c3b9c71b0895c8605"}},{"ruleId":"D2","level":"warning","message":{"text":"SstableBuilder::add_impl (cognitive 24): SstableBuilder::add_impl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, 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/storage/src/hummock/sstable/builder.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"6155ffa650bf365ab1620282ed381cf7bbc3ef141cea1aa29cae53562f7643bd"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacitySplitTableBuilder::check_switch_builder (cognitive 24): CapacitySplitTableBuilder::check_switch_builder has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 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/storage/src/hummock/sstable/multi_builder.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"099bc9bd31d56ffa1db1bf3bd16a0186e3a6a691cadefc410bce55f15f3880c5"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockStorageReadSnapshot::build_read_version_tuple_from_all (cognitive 24): HummockStorageReadSnapshot::build_read_version_tuple_from_all has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/hummock_storage.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fb55eca15aaff6895833def8e4c7c54a08f61a4f64f7fe81f0b9402024bd15"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNCache::delete (cognitive 24): TopNCache::delete has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 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":"src/stream/src/executor/top_n/top_n_cache.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"305cf00f1a85594a68e29f11dbeb943812428d8a1a280c1f52d5668b61c2ab79"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlServerValidator.validateTableSchema (cognitive 24): SqlServerValidator.validateTableSchema has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6, 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b9ab06e690f77e588d4b17ad0ddaf9cf7a85e73c76edb189a1b330d99e5e66"}},{"ruleId":"D2","level":"warning","message":{"text":"DbzChangeEventConsumer.handleBatch (cognitive 24): DbzChangeEventConsumer.handleBatch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (6 pts), error handling 1 (2 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzChangeEventConsumer.java"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"65db3fc8819735060874c5f9992e5002ade0ed92586b9e072fea4e59a277e18d"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_cmd_all::standalone::standalone (cognitive 23): risingwave_cmd_all::standalone::standalone has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd_all/src/standalone.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d127540277fdc8459ae68abc9e082aae7b6282d799f558fcf1c952282bba8522"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector_codec::decoder::avro::schema::avro_type_mapping (cognitive 23): risingwave_connector_codec::decoder::avro::schema::avro_type_mapping has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/codec/src/decoder/avro/schema.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc146713e493e21bb4f0605ce6733299b406f6e1c0d358351adfc160dbbb089"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceStreamChunkRowWriter::do_action (cognitive 23): SourceStreamChunkRowWriter::do_action has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 5 (8 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":"src/connector/src/parser/chunk_builder.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6577a7f23a7298831ab4e7a034313a309ebb5fff63e5a9916a85257df1ec371"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::iceberg::create_table::create_table_if_not_exists_impl (cognitive 23): risingwave_connector::sink::iceberg::create_table::create_table_if_not_exists_impl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (7 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":"src/connector/src/sink/iceberg/create_table.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ff1cc889f9ace71b1b9eb9702f2010eb429736b003a166e9f474ba8d9fbfa7"}},{"ruleId":"D2","level":"warning","message":{"text":"Unit::from_str (cognitive 23): Unit::from_str has cognitive complexity 23 (threshold 15). Drivers by points: if/else 23. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named 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/expr/impl/src/scalar/extract.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"21df28c4b5e86a75d0464d20b5c7456448f8b5f9fa81d0fe487085715f0eed2c"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionAttr::parse (cognitive 23): FunctionAttr::parse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (19 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows 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/expr/macro/src/parse.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffa0b58562a134f3173ec04a6d75df7956af1d865b38f8358b5afc0e278057e"}},{"ruleId":"D2","level":"warning","message":{"text":"MetricsReaderImpl::get_channel_delta_stats (cognitive 23): MetricsReaderImpl::get_channel_delta_stats 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":"src/frontend/src/metrics_reader.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"486c0b23aa10b22c2e770561e341c50a9962073f773203e2446f9f54dbfe6b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalJoin::to_stream_temporal_join_with_index_selection (cognitive 23): LogicalJoin::to_stream_temporal_join_with_index_selection has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a9c3a9b5acd074af2f580c00288346c2f5492731fd81fec1c4dc02a229df28"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_user::handle_create_user (cognitive 23): risingwave_frontend::handler::create_user::handle_create_user has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, 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":"src/frontend/src/handler/create_user.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c2d9baaa6649c9bd2426623cec2b47b9e11e4ebba3d59d2fa8114576a11197"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_table::bind_sql_column_constraints (cognitive 23): risingwave_frontend::handler::create_table::bind_sql_column_constraints has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f9828777e26c19eeb6eeb8afbd59e7cd90e1ec48f17412cfaddfeaf7d74723"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::cdc::reject_pk_filtered_by_debezium_column_filter_inner (cognitive 23): risingwave_frontend::handler::cdc::reject_pk_filtered_by_debezium_column_filter_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/cdc.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1c73efdcadaeca7316512275a210e3fd6257ad36cd7e08a35c4d0b5458d4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalBarrierWorkerContextImpl::resolve_hummock_version_epochs (cognitive 23): GlobalBarrierWorkerContextImpl::resolve_hummock_version_epochs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (6 pts), loops 3 (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":"src/meta/src/barrier/context/recovery.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e25ecb73a662e0b6b6bfe40faca161157f71f254a4f54d184e36d804aa24b45"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockCompactionEventHandler::try_dispatch_tasks (cognitive 23): HummockCompactionEventHandler::try_dispatch_tasks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_event_loop.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9265459826107c827d306d0d9041a91e8a811c71524a46226a75571744e22a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::check_dead_task (cognitive 23): HummockManager::check_dead_task has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/timer_task.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1d48fa4629096ab1e892493edb903262d7e39d56525bf47cc2ef271f2d666b"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::manager::iceberg_compaction::gc::plan_manifest_rewrite (cognitive 23): risingwave_meta::manager::iceberg_compaction::gc::plan_manifest_rewrite has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/iceberg_compaction/gc.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c597e17bdb6021ec983deffaa2913d63fb54a37dc3afd38e3d335670ac0fa52"}},{"ruleId":"D2","level":"warning","message":{"text":"IdExpander::visit (cognitive 23): IdExpander::visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/config/id_expander.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bccecb8182b8be958a4e8172ca385cca73aa63a2587432d16fc6cd424eff140"}},{"ruleId":"D2","level":"warning","message":{"text":"LakekeeperService::create_default_warehouse (cognitive 23): LakekeeperService::create_default_warehouse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/task/lakekeeper_service.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3296f9e69e1f75ace74563ded0cbafd27fa1e05ecfd7c68dd196eafdd51e1653"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_create_database (cognitive 23): Parser::parse_create_database has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebeae3df0bccfb2d497bdca85b2a6356fed0ffedfc965cbf9072139d740a5de"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::compactor_runner::compact_with_agent (cognitive 23): risingwave_storage::hummock::compactor::compactor_runner::compact_with_agent has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5, loops 3 (4 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compactor_runner.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"687319744f92a718402776d135caf0b433ee186c9afc0e47fc295439c3451c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"KvLogStoreReader::next_item (cognitive 23): KvLogStoreReader::next_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (7 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":"src/stream/src/common/log_store_impl/kv_log_store/reader.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde5891a9a63336cd50ca72c6241e414e680a56d81a06d046bc7cf55e4d71cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"AppendOnlyDedupExecutor::executor_inner (cognitive 23): AppendOnlyDedupExecutor::executor_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dedup/append_only_dedup.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ccd406e7d5fa3547aba7adc94409814df23d1cc40aa5413ef44678b8406d11"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsumerFuture::next_event (cognitive 23): ConsumerFuture::next_event has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 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":"src/stream/src/executor/dispatch/dispatch_sync_log_store.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"398d63213b54c8169b8d2a0923220126f6aa2eb773832774f94e5e7ce94714bf"}},{"ruleId":"D2","level":"warning","message":{"text":"BinlogHistoryRecordComparator.isPositionAtOrBefore (cognitive 23): BinlogHistoryRecordComparator.isPositionAtOrBefore 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/binlog/history/BinlogHistoryRecordComparator.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b62df79ec6a6e1b23b83cdccb8a7f5d47e65b77c7d8f7f7978fa9ae2b264683"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamChunkDeserializer.buildValueGetter (cognitive 23): StreamChunkDeserializer.buildValueGetter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, match/switch 3 (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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/deserializer/StreamChunkDeserializer.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beddde277514ee1fb1ecb152fe89b62da94f2bf0318224656bb2905888c7237"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_left_outer_join_with_non_equi_condition (cognitive 22): HashJoinExecutor::do_left_outer_join_with_non_equi_condition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"535a1a3034a497edf772fc4b1a42ce735e4ca23d75ea5383f58bce28182f8286"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_full_outer_join_with_non_equi_condition (cognitive 22): HashJoinExecutor::do_full_outer_join_with_non_equi_condition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26ea9b6b514247943ed5e77cadd0909a5c7dd30f9711458f701f3b848b0f873"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::find_asof_matched_rows (cognitive 22): HashJoinExecutor::find_asof_matched_rows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"6033c95d6013d9de3075931c0059f2f86630258503ddac8b5f09984421156a13"}},{"ruleId":"D2","level":"warning","message":{"text":"RowSeqScanExecutor::do_execute (cognitive 22): RowSeqScanExecutor::do_execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/row_seq_scan.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d0d21e978ce4625e22c870b877cc8e2b7aa8f271e2219ef8ece55a25b2661"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergSplitEnumerator::list_scan_tasks_inner (cognitive 22): IcebergSplitEnumerator::list_scan_tasks_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (4 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":"src/connector/src/source/iceberg/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa929bf310374c1ce6206ad0f2a25ba980916ef50ddb8d93d54a39003b48d3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::hummock::list_version::list_version (cognitive 22): risingwave_ctl::cmd_impl::hummock::list_version::list_version has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 3, boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/hummock/list_version.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8189275f93b25bad9723e64470aa3ddda0d1a888963ae7ba73f36e7d20a374d"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_grouping_items_expr_in_select (cognitive 22): Binder::bind_grouping_items_expr_in_select has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (19 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/select.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4725cfacef0d2a0dc413b7f979047e23707cfdce5dd920831f5821e946a52d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalChangeLog::prune_col (cognitive 22): LogicalChangeLog::prune_col has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_changelog.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7d3aa7d7286b20da2932615c93f68e57fb3eccd61452b67124b0f45cde8bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalMultiJoin::eq_condition_derivation (cognitive 22): LogicalMultiJoin::eq_condition_derivation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 6 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"637b989ac751cde77c4328245761dc0bec01160091d5ab57c2d36a65473c4474"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::catalog::system_catalog::rw_catalog::rw_iceberg_files::read (cognitive 22): risingwave_frontend::catalog::system_catalog::rw_catalog::rw_iceberg_files::read has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 4 (9 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b84a8fd54bade718c7f3d7dee4ef35cd4a9bd7c4aa76d0ac7260dc590e582e"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::optimizer::rule::over_window_to_topn_rule::handle_rank_preds (cognitive 22): risingwave_frontend::optimizer::rule::over_window_to_topn_rule::handle_rank_preds has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (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":"src/frontend/src/optimizer/rule/over_window_to_topn_rule.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e488d00294ef299832f3b7f0307d3b819b5764254a28e01745aa757c8cbce91"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::expr::type_inference::func::top_matches (cognitive 22): risingwave_frontend::expr::type_inference::func::top_matches has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 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":"src/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"93364f1331bb4855257d343809f0575d93294c3544590c96626b6f2ce8a869d1"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::binder::relation::match_recognize::check_pattern_bounds (cognitive 22): risingwave_frontend::binder::relation::match_recognize::check_pattern_bounds has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5315b5c7322d7df823667c2c5fd25c9b1e724a35656bf505de6025b44f95531"}},{"ruleId":"D2","level":"warning","message":{"text":"TrivialMovePicker::pick_multi_trivial_move_ssts (cognitive 22): TrivialMovePicker::pick_multi_trivial_move_ssts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/picker/trivial_move_compaction_picker.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"df755b381e1d1ff0fe528b9391552da1bea1a35fe31e4545a597204c33c5090b"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualCompactionSelector::pick_compaction (cognitive 22): ManualCompactionSelector::pick_compaction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 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":"src/meta/src/hummock/compaction/selector/manual_selector.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a211eff923339fcce9a16f20aeda4381709ec1eb734b3e88b2bc3193c61101c"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::split_compaction_group_impl (cognitive 22): HummockManager::split_compaction_group_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_group_schedule/topology.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa2d8ce07c2346609d699d911a7400c438b8d2e86e58d487150c821b3cce00d"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::write_time_travel_metadata (cognitive 22): HummockManager::write_time_travel_metadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). Of this number, 14 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":"src/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8246071dd567269e111f07740156eff954871f9eb5f1c984ed23e727e5641652"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::controller::scale::find_no_shuffle_graphs (cognitive 22): risingwave_meta::controller::scale::find_no_shuffle_graphs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/scale.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b0ff6cbd0b004495008d11a066c5bc61b280ea756148af983efdb8e64ac25d"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_object_store::object::s3::set_error_should_retry (cognitive 22): risingwave_object_store::object::s3::set_error_should_retry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/object_store/src/object/s3.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fccd46a4d5528a16b463ff8dae3d371b9130f684ebea33e634d53fc5330a2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LakekeeperService::bootstrap_lakekeeper (cognitive 22): LakekeeperService::bootstrap_lakekeeper 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":"src/risedevtool/src/task/lakekeeper_service.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"181b03ec6f5e4816d244979c7a7da907e4740dd93722a21100377620498f0a38"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockVersionCommon::init_with_parent_group_v2 (cognitive 22): HummockVersionCommon::init_with_parent_group_v2 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcbf3dae3595ba156e0bc2db1293d05d16e844e69077f48f3e798b2fb554063"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::utils::filter_with_delete_range (cognitive 22): risingwave_storage::hummock::utils::filter_with_delete_range has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/utils.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"456a708bb2ddc9d856f0e60a0435a105b2942a7b38d8ccb5dc8eff053e4d5b47"}},{"ruleId":"D2","level":"warning","message":{"text":"StateTableRowStore::seal_current_epoch (cognitive 22): StateTableRowStore::seal_current_epoch has cognitive complexity 22 (threshold 15). Drivers by points: loops 3 (13 pts), match/switch 3 (7 pts), boolean chains 1, if/else 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc72b05c6790cbbc33033b751ef4d02597f2d7cdf074c20b645edd6fed018b64"}},{"ruleId":"D2","level":"warning","message":{"text":"BackfillExecutor::execute_inner (cognitive 22): BackfillExecutor::execute_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/no_shuffle_backfill.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60b8f97e927c69b4b231d823013026fa712df42f342f66c7fddb131b893f8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsumeUpstreamStream::new (cognitive 22): ConsumeUpstreamStream::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (9 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":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4262d3b0f5b99b048a37cd55e3cdb416e533a9a9a2b372f230c67162b8b224b2"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterExecutorInner::filter (cognitive 22): FilterExecutorInner::filter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (10 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/filter.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1731c052dd4e6e6cbd764dc1c20731c8cf5df0a6b4c959840b76f0d447920c"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalMatcher::rescan (cognitive 22): IncrementalMatcher::rescan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/match_recognize/incremental.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e56112547e4bfc9bb23a6b0f688c458c9a7e7aed763615549e8a565d03f9820"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchIcebergFetchExecutor::into_stream (cognitive 22): BatchIcebergFetchExecutor::into_stream has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_iceberg_fetch.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba28ebda33f43a47850870beb10280566bf218f7c0e882e7675e121705514687"}},{"ruleId":"D2","level":"warning","message":{"text":"FsListExecutor::into_stream (cognitive 22): FsListExecutor::into_stream has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 2 (6 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_list_executor.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c197cbb0240934b5d03a7c5fc83d1a0dd534e3f430231d8c9aab8899944b85"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceExecutor::persist_state_and_clear_cache (cognitive 22): SourceExecutor::persist_state_and_clear_cache has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/source_executor.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66ad35dbf87a1f9b5b6c3bc764d3dbdd8feee8a922af6f139de742f16b8ab09"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNCache::insert (cognitive 22): TopNCache::insert has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/top_n_cache.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c130105d78144bf34f8b55b73d606acae0cd24cccae28169048434ff59a54006"}},{"ruleId":"D2","level":"warning","message":{"text":"ValuesExecutor::execute_inner (cognitive 22): ValuesExecutor::execute_inner has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 4 (9 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/values.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e863717edd158ec85b70ab8c1f4d65b5f005af6f47a20a725c173f0c78a34e6"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.main (cognitive 22): extract.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 8 (9 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5c6697c4eb97dc9297bf967bb45cafc5a73ebd4848d7aeed6697e2c1cf832c"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_left_semi_join_with_non_equi_condition (cognitive 21): HashJoinExecutor::do_left_semi_join_with_non_equi_condition has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b1a0038640d66801642d964f659e4ce0830282fe0e726961834d7b89bea657"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_full_outer_join (cognitive 21): HashJoinExecutor::do_full_outer_join has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a569b275e06e7aa310ee4424b726ab3fa3b8139c50379a810b97a85c59402bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"LimitExecutor::do_execute (cognitive 21): LimitExecutor::do_execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 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":"src/batch/executors/src/executor/limit.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c82bdef66721e8c8a58b4a8b4b1d4a689fc1beca6d67532c03ef3a9038a37ec"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNHeap::push (cognitive 21): TopNHeap::push has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/top_n.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc6748cfe660301ddef7c9cb99315a81107eb8f2484851ef18e95f9d0e9a7e6"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_cmd_all::single_node::map_single_node_opts_to_standalone_opts (cognitive 21): risingwave_cmd_all::single_node::map_single_node_opts_to_standalone_opts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (20 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cmd_all/src/single_node.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e5a3824628a612bf249e444c386f5c91717849ea8027cb959297d1e3da288a"}},{"ruleId":"D2","level":"warning","message":{"text":"DecoupleCheckpointLogSinkerOf::consume_log_and_sink (cognitive 21): DecoupleCheckpointLogSinkerOf::consume_log_and_sink has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (7 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":"src/connector/src/sink/decouple_checkpoint_log_sink.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1914dcd2f3d144d09993d7da2cfe0b5d68072f37e16507127392cf12e108e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ElasticSearchOpenSearchFormatter::convert_chunk (cognitive 21): ElasticSearchOpenSearchFormatter::convert_chunk 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":"src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_formatter.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"86192b84425a91c192aa54e5e6035849f0a194392b793a0adc03cd5d24f3b464"}},{"ruleId":"D2","level":"warning","message":{"text":"KinesisSplitReader::into_data_stream (cognitive 21): KinesisSplitReader::into_data_stream 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":"src/connector/src/source/kinesis/source/reader.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb0416846888fb830f79649e4e2e439b4a8c811d3ebee5f7380722c1dc437ef"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::iceberg::create_table::parse_order_key_exprs (cognitive 21): risingwave_connector::sink::iceberg::create_table::parse_order_key_exprs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 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":"src/connector/src/sink/iceberg/create_table.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60d7c21cf29987dc63b0bfcc2361b90d62e838ef311ad9d1c12dbe42bae3050"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::source::iceberg::scan_task_to_chunk_with_deletes (cognitive 21): risingwave_connector::source::iceberg::scan_task_to_chunk_with_deletes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/iceberg/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d703ea8aeb93ca9a6955dbf2e46acd8ddaa4afdbad87c89098266aa0c3330b3"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::http::validate_http_sink (cognitive 21): risingwave_connector::sink::http::validate_http_sink has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (7 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":"src/connector/src/sink/http.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1882374aa5825a68ed37b7fad680db402749bbb1c16ec9eeaaaab283c154c0"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::hummock::validate_version::print_version_delta_in_archive (cognitive 21): risingwave_ctl::cmd_impl::hummock::validate_version::print_version_delta_in_archive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (11 pts), loops 4 (10 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/hummock/validate_version.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82fa78b03524b8690466a8520583836d0f740bd262ad0c04104683c4707dd28"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCase::run_sql (cognitive 21): TestCase::run_sql has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (5 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":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"46524b3ade4118917427fbff4b2b90c653a8a7362df0191aa89bd168fee445b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_column (cognitive 21): Binder::bind_column has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (6 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":"src/frontend/src/binder/expr/column.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd68ac09e3cde93905bc8001feeb2eb94fc7047c82e09b256ea333e70bdc6e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"TableScanIoEstimator::match_index_column (cognitive 21): TableScanIoEstimator::match_index_column has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 3, match/switch 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":"src/frontend/src/optimizer/rule/index_selection_rule.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a5342a8453f582cb526874891d348c356acec91db535914f4e94c6ce30bfa6"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifyFirstLastValueRule::apply (cognitive 21): UnifyFirstLastValueRule::apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 9 (10 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":"src/frontend/src/optimizer/rule/unify_first_last_value_rule.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b05d934785a4173a8671b0ade2de69b80e1703bae1e95ebdeeedb2e697117e"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::drop_function::handle_drop_function (cognitive 21): risingwave_frontend::handler::drop_function::handle_drop_function has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/drop_function.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e059476f1f83b40c98c26f2a52cbf0e5e3ba7a0d988c146870beccd5b2aab92"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduledBarriers::abort_and_mark_blocked (cognitive 21): ScheduledBarriers::abort_and_mark_blocked has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). 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":"src/meta/src/barrier/schedule.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"55360f7b90afa6d6e9ab9a88878eb9554bf4c0642078cc3026d7c4dc3f105b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::alter_owner (cognitive 21): CatalogController::alter_owner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ab9a4e2bdfbf8e665c2c93ca49b774497063bda2ed7eec9fd8711853e2de70"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::hummock::manager::table_change_log::resolve_table_change_log_truncate_epochs (cognitive 21): risingwave_meta::hummock::manager::table_change_log::resolve_table_change_log_truncate_epochs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (8 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/table_change_log.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bbc0c1dab603fdebef1028d0dd0076fd14b5ca4200ebf909ed31b5fbfa9895"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_optional_column_option (cognitive 21): Parser::parse_optional_column_option has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05323a9b8ce5a8a9e877bae4756915add16b50d6b0f00653c99d7eb1ef0939"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_table_factor_inner (cognitive 21): Parser::parse_table_factor_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":5658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be47e73e2690242c2836c634bc922ca58805e5fe9da9c952f9e46babf156faa"}},{"ruleId":"D2","level":"warning","message":{"text":"DataCacheRefillTaskGenerator::filter_by_inheritance_filter (cognitive 21): DataCacheRefillTaskGenerator::filter_by_inheritance_filter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 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":"src/storage/src/hummock/event_handler/refiller.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8a2e235ed25d0684ff65e7565bef44809963f0b4e2bcfa3474b05ed43d5b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"LogStoreRowOpStream::into_vnode_log_store_item_stream (cognitive 21): LogStoreRowOpStream::into_vnode_log_store_item_stream has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/log_store_impl/kv_log_store/serde.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1b8e6b920c20177909349c279628f61462adcbd927eabf3a207969e6c906ca"}},{"ruleId":"D2","level":"warning","message":{"text":"AsOfJoinExecutor::into_stream (cognitive 21): AsOfJoinExecutor::into_stream has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a1785e3e22cf3ba7b7f3db4ab2c3ac6565a6d37f7e753899b6ad377c204418"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::into_stream (cognitive 21): HashJoinExecutor::into_stream has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5648f18ecfdc0a3c461afc66a247e22deaa588f34e00e6c171e21a30c9bfade"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::exchange::input::remote_input::run_inner (cognitive 21): risingwave_stream::executor::exchange::input::remote_input::run_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (8 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/exchange/input.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"285663748f8b98528aee7dfc5b62ae3850228a9053f32927f8e2be29d0b5b7c7"}},{"ruleId":"D2","level":"warning","message":{"text":"PgProtocol::run (cognitive 21): PgProtocol::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bb4822247d4358e233b77adc7e8ecd8bf77487e3561a67ac14e595830db85a"}},{"ruleId":"D2","level":"warning","message":{"text":"PgProtocol::do_process_inner (cognitive 21): PgProtocol::do_process_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37fdd60b5b1838c5a3a85b907e8c43977858b2742ce1b6627ffba42ab7b464b"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaLoggerLevelOverrides.parse (cognitive 21): JavaLoggerLevelOverrides.parse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, loops 1 (nesting depth added 9). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/tracing/src/main/java/com/risingwave/tracing/TracingSlf4jImpl.java"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6ac46296a452105d71c6a119a98ef443ea28b944363bc2e06de9de7d2983a3"}},{"ruleId":"D2","level":"warning","message":{"text":"heap_profiling.HeapProfiling (cognitive 21): heap_profiling.HeapProfiling has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, boolean chains 6, error handling 3 (4 pts), loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 93, 130, 87, \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":"dashboard/pages/heap_profiling.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3051c6dfa62d0a70f4ee34425b601eb29b926032a8e6cc8941a41aee310c07c5"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamChunk::eliminate_adjacent_noop_update (cognitive 20): StreamChunk::eliminate_adjacent_noop_update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, 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":"src/common/src/array/stream_chunk.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"015920074f75baa7a69fbc426414c7db94d497853557a294c238cc73ef177230"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecificParserConfig::new (cognitive 20): SpecificParserConfig::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (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":"src/connector/src/parser/config.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ee0cdb4c979fb65d90a1ca60d9d104af664758fea365b5f2dcc650dabb215d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarAdapter::from_scalar (cognitive 20): ScalarAdapter::from_scalar has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 3 (8 pts), if/else 1 (2 pts) (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":"src/connector/src/parser/scalar_adapter.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4392d46f1202ba1f197b98b96d9965be728888c8c4fc8cea1458ffa5174eee"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateEncoder::build (cognitive 20): TemplateEncoder::build has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (8 pts), boolean chains 6, if/else 2 (6 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/formatter/mod.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c130026638228ceb5d4b1d6e794a48817c6ccb6bdeb353f4c6049cdff6204c9"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExternalTableReader::snapshot_read_inner (cognitive 20): MySqlExternalTableReader::snapshot_read_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 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":"src/connector/src/source/cdc/external/mysql.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2221943829842b898d62591d4e7781ff3036041af9743a88844af028c4a738"}},{"ruleId":"D2","level":"warning","message":{"text":"OpendalReader::stream_read_lines (cognitive 20): OpendalReader::stream_read_lines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 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":"src/connector/src/source/filesystem/opendal_source/opendal_reader.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c655bf694d5f23e38bacabb5432feabfd765b5df32f31f44bdf1113afd1404fa"}},{"ruleId":"D2","level":"warning","message":{"text":"SomeAllExpression::resolve_bools (cognitive 20): SomeAllExpression::resolve_bools has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/core/src/expr/expr_some_all.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbd0cb62e16eae7462d538905f958002bc9869427a37c2c5e1c25b1dc959f75"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::scalar::regexp::regexp_split_to_array (cognitive 20): risingwave_expr_impl::scalar::regexp::regexp_split_to_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/regexp.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"c884a58fa21731f0971f614f297f715f879ed66c744709692c1bdb86a81a3f35"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionAttr::generate_type_infer_fn (cognitive 20): FunctionAttr::generate_type_infer_fn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (20 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":"src/expr/macro/src/gen.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3fbb8bac9753eda941d01685dd71ab199e8b5e044d2b644cefb0ab3c52a3f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_table_function (cognitive 20): Binder::bind_table_function has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 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":"src/frontend/src/binder/relation/table_function.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b327c29bb31f6f207553e31f027f4ced11cfe4d8d71aef01c062630bd963a67a"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::corresponding (cognitive 20): Binder::corresponding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 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":"src/frontend/src/binder/set_expr.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79efe4e9f5c82b669abcd41f4f72e81c6b9a7a38082f54695c7b841c81ad531"}},{"ruleId":"D2","level":"warning","message":{"text":"Agg::infer_stream_agg_state (cognitive 20): Agg::infer_stream_agg_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), loops 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":"src/frontend/src/optimizer/plan_node/generic/agg.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8205d450dd0c5563866245ddc25481971cd4694dc02695707b1cee58dd144d"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalScan::try_better_locality (cognitive 20): LogicalScan::try_better_locality has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 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":"src/frontend/src/optimizer/plan_node/logical_scan.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c59303ba1bca8f296513345ab7edeb5724774b90b19f16b49a86275361ab781"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamKeyChecker::visit_logical_agg (cognitive 20): StreamKeyChecker::visit_logical_agg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_visitor/jsonb_stream_key_checker.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0f338f5c657d95d42aacdaa1b299e697dfe393728ce33ca308dbbe8a6bbe49"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyJoinTransposeRule::apply (cognitive 20): ApplyJoinTransposeRule::apply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows 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/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"636b9b78ec9bff7af7619dadcb14e1909753d32fda2d4d93878b044c074fce53"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupingSetsToExpandRule::apply (cognitive 20): GroupingSetsToExpandRule::apply has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/grouping_sets_to_expand_rule.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eceaa5fa2e7e8497c6198c740f1cbf637a58a726c738a5d10add3d708e0f303"}},{"ruleId":"D2","level":"warning","message":{"text":"Condition::extract_eq_conds_within_range (cognitive 20): Condition::extract_eq_conds_within_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/condition.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d0c04f6efc733cac6c0c6b4df6641fd4c246e42f3f350a323ec355d09a04ec"}},{"ruleId":"D2","level":"warning","message":{"text":"OverwriteOptions::new (cognitive 20): OverwriteOptions::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 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":"src/frontend/src/utils/overwrite_options.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b42592e2545aed02708d3a9356c264205c266820c500eededdb6482d27bdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::catalog::system_catalog::rw_catalog::rw_iceberg_all_files::read (cognitive 20): risingwave_frontend::catalog::system_catalog::rw_catalog::rw_iceberg_all_files::read has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 3 (6 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5583fa862b05d0b97479bdb3cab6e473b4b2880ee045fd688ff0c66e7ab28ec"}},{"ruleId":"D2","level":"warning","message":{"text":"BarrierWorkerRuntimeInfoSnapshot::validate_database_info (cognitive 20): BarrierWorkerRuntimeInfoSnapshot::validate_database_info has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4096030273f880eeaf70e57ffc5f900f3ad2585b1d0e53c6b92f70877e9be637"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::get_table_change_log_truncate_info (cognitive 20): CatalogController::get_table_change_log_truncate_info has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (6 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af618d9d205f2882313af8ec80f5b966d94837683def4cc8b3fe104cb152e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"FragmentActorBuilder::rewrite_inner (cognitive 20): FragmentActorBuilder::rewrite_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/actor.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aebdb866314f41608250880fbee20685454962fb48d485688f742bf8231ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::dashboard::handlers::get_streaming_stats (cognitive 20): risingwave_meta::dashboard::handlers::get_streaming_stats has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/dashboard/mod.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1030d25241f905f7941702038aa498d477636a3df131551a5a91bccd0800e8"}},{"ruleId":"D2","level":"warning","message":{"text":"risedev::bin::risedev-dev::task_main (cognitive 20): risedev::bin::risedev-dev::task_main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e600a939a3e456b3305cf66e708497697d1ff5d4bae0b856f64a5daf3fa50b1"}},{"ruleId":"D2","level":"warning","message":{"text":"MetaMemberManagement::refresh_members (cognitive 20): MetaMemberManagement::refresh_members has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rpc_client/src/meta_client.rs"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5888c5aaa8ccb66511097e39a7527b278916e69a40c512d9799ec7da9d4fa4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_create (cognitive 20): Parser::parse_create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19 (20 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b63572348cc4b25ae0780c6e73a83184fbc663f143406226b03192625a59b"}},{"ruleId":"D2","level":"warning","message":{"text":"DataCacheRefillTaskGenerator::generate_unfiltered_tasks (cognitive 20): DataCacheRefillTaskGenerator::generate_unfiltered_tasks 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":"src/storage/src/hummock/event_handler/refiller.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"3916ae5ed134dc443168ed16c1cd563099bc2f974fb3dd2182b0ccf79b588da6"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::shared_buffer_compact::generate_splits (cognitive 20): risingwave_storage::hummock::compactor::shared_buffer_compact::generate_splits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 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":"src/storage/src/hummock/compactor/shared_buffer_compact.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5fe740bf018a3edaabefa8654a343dda623a617f871167e67eca94c1bdb6be"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::validator::validate_ssts (cognitive 20): risingwave_storage::hummock::validator::validate_ssts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/validator.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d3108656d2dca56c2d1208e651e31fbe2f45379531271d28398abb67dc7b34"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::utils::merge_stream (cognitive 20): risingwave_storage::hummock::utils::merge_stream has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/utils.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7c659a8b62735336d02176671a21a1806a4bb0531e00ef8184d908e1053c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"LogStoreBufferReceiver::truncate_buffer (cognitive 20): LogStoreBufferReceiver::truncate_buffer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/log_store_impl/kv_log_store/buffer.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fefce0f324b1a3e280533f0bedab6787f3043d7311ae4c0f8a2b6dacf957cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::eq_join_oneside (cognitive 20): HashJoinExecutor::eq_join_oneside has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (7 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":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbef1549cd629e169859a5627570e328d7c98cb1bac50c11210a5b67775220d6"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionDeleteMergerExecutor::execute_inner (cognitive 20): PositionDeleteMergerExecutor::execute_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/iceberg_with_pk_index/position_delete_merger.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"438544fae6bc24b2a77f9ed329b47c06ba4307860c61450ee350991213715df0"}},{"ruleId":"D2","level":"warning","message":{"text":"FsFetchExecutor::replace_with_new_batch_reader (cognitive 20): FsFetchExecutor::replace_with_new_batch_reader has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (7 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca31961044108b51fd65056461270aac993cd55abd92e28acd1d5739dd86bf"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalBarrierWorker::handle_actor_op (cognitive 20): LocalBarrierWorker::handle_actor_op has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (7 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/task/barrier_worker/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"63abe7c26df0ba02413714a4349db3e7199b83eb17c1030fa573799b60c949ea"}},{"ruleId":"D2","level":"warning","message":{"text":"PgProtocol::inner_process_query_msg_one_stmt (cognitive 20): PgProtocol::inner_process_query_msg_one_stmt has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89b2f0fcbefbc5780309734fb3f1a6051a81ed72145fcdda290e7f0418a0877"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresStreamingChangeEventSource.commitOffset (cognitive 20): PostgresStreamingChangeEventSource.commitOffset has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 4 (7 pts), boolean chains 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"265784847d6aa7856f372ebad28e1e9516dd1b91ecb0bb23185361f575439983"}},{"ruleId":"D2","level":"warning","message":{"text":"JDBCSqlRunner.executeSqlWithProps (cognitive 20): JDBCSqlRunner.executeSqlWithProps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 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":"java/connector-node/risingwave-jdbc-runner/src/main/java/com/risingwave/runner/JDBCSqlRunner.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbee0b203ed586d6426fe40ee65a486e02b9a441dbff4426052ea110b463908"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresValidator.validatePublicationPrivileges (cognitive 20): PostgresValidator.validatePublicationPrivileges has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"664589b5f11537a09b349b801a8b49dd38ed8cb513764ece876589be3d0f233e"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresValidator.validateTableSchema (cognitive 20): PostgresValidator.validateTableSchema has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, ternaries 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db6dc1d54ff23cbe42a0947d20845d972448b3d33fca3719244f8bd8c56221c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeleteExecutor::do_execute (cognitive 19): DeleteExecutor::do_execute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/delete.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c976ee8c6eacdc6a7290980f0ee1ab9bb353bf479f357fa3f44aaabaf9d712"}},{"ruleId":"D2","level":"warning","message":{"text":"SortAggExecutor::do_execute (cognitive 19): SortAggExecutor::do_execute 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":"src/batch/executors/src/executor/sort_agg.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee9ddbe338fea5875cd9d67f06dc4ae708fda0caa7d98dfd16deb75dd920af7"}},{"ruleId":"D2","level":"warning","message":{"text":"SortOverWindowExecutor::do_execute (cognitive 19): SortOverWindowExecutor::do_execute has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/sort_over_window.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e67761d057a674b8aadb8c68a1e77ebedbf9d85558e617c2ffea4d21ebaae2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRef::deref (cognitive 19): JsonRef::deref has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/codec/src/decoder/json/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacf6c1f573116c155993dcd4a2841aeac58258a575c9f3276cf59a90562caeb"}},{"ruleId":"D2","level":"warning","message":{"text":"MockSinkCoordinationRpcClient::coordinate (cognitive 19): MockSinkCoordinationRpcClient::coordinate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 3 (6 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":"src/connector/src/sink/mock_coordination_client.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55572776fa7ce6cb708ac291503f20e740b759a12bfaf43a4714f001e1470a4"}},{"ruleId":"D2","level":"warning","message":{"text":"MongodbSink::validate (cognitive 19): MongodbSink::validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/mongodb.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2f683f5725413435d8791d3f4396de3ac2ad45684541c9267e8a9de5119e06"}},{"ruleId":"D2","level":"warning","message":{"text":"TurbopufferLogSinker::consume_log_and_sink (cognitive 19): TurbopufferLogSinker::consume_log_and_sink has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/turbopuffer.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2161e27c8056dbc7b31df920eb7c253c33348e1de005028537b8d391eac5af7"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresExternalTableReader::as_uneven_splits (cognitive 19): PostgresExternalTableReader::as_uneven_splits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 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":"src/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0179daef640746939f645f8587392f839f60c332cdae44ca89490c19f7927e"}},{"ruleId":"D2","level":"warning","message":{"text":"NatsPropertiesConsumer::set_config (cognitive 19): NatsPropertiesConsumer::set_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named 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/connector/src/source/nats/mod.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a3707a1ca3e9f67e55474be8ef57798296e62d0f7adb7f3691c55cc0f6fe1e"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::iceberg::create_table::field_is_compatible (cognitive 19): risingwave_connector::sink::iceberg::create_table::field_is_compatible has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, match/switch 2 (3 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":"src/connector/src/sink/iceberg/create_table.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f5e8ac759d34ad68b05d215c3dd98b18f659932b4d2cf5939200deb1aee523"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiEmbedding::eval (cognitive 19): OpenAiEmbedding::eval has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 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":"src/expr/impl/src/scalar/ai_model.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"286748a63f892da2fb38ed47e82edefb078c963ccaac2f279628c368cbb41872"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::scalar::array_concat::array_cat (cognitive 19): risingwave_expr_impl::scalar::array_concat::array_cat has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 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":"src/expr/impl/src/scalar/array_concat.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c8de0c5f4a4ac9d26ee48ac019d2c9fe3f31e070fdeb687f948f66bed134b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::resolve_iceberg_metadata_relation (cognitive 19): Binder::resolve_iceberg_metadata_relation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 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":"src/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"403b532f93683ca7fa367392746b6a83c02682fffa7ee1863fd31752e04e37be"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::check_privilege (cognitive 19): Binder::check_privilege has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 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":"src/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacdbfe4a6dddc0d8764bb1026619578d430963a7a4abfb041b1866adcdbbb8d"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnIdGenerator::generate (cognitive 19): ColumnIdGenerator::generate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). 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 item inside it that branches (handle). 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":"src/frontend/src/handler/create_table/col_id_gen.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"62add166a315d6e127b194eb8aa127d88abc6ffad1cd19cb7c43696d7221185a"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalOverWindow::convert_window_function (cognitive 19): LogicalOverWindow::convert_window_function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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":"src/frontend/src/optimizer/plan_node/logical_over_window.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0cc57eefe47f286bf74b8dc46eb13c6efa99ae45bb250639dfbced91b03a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamSink::derive_sink_type (cognitive 19): StreamSink::derive_sink_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (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":"src/frontend/src/optimizer/plan_node/stream_sink.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bbe04bbbfd1c5cc01251a5a2f55e0ea363ec1752c64bce8e8632cb570b8854"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionSimplifyRewriter::rewrite_expr (cognitive 19): ExpressionSimplifyRewriter::rewrite_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 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":"src/frontend/src/optimizer/rule/logical_filter_expression_simplify_rule.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2354bc3cfc9a3657fc586680c15ba43903e9d62f6178d3aea75a036a798fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryRunner::run (cognitive 19): QueryRunner::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (5 pts), boolean chains 2, 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":"src/frontend/src/scheduler/distributed/query.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1e7b00ffc97c2fb9a0e2603e807594b079a0fa759beb3bc552d5d7ea28b556"}},{"ruleId":"D2","level":"warning","message":{"text":"StageRunner::schedule_tasks_for_root (cognitive 19): StageRunner::schedule_tasks_for_root has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), 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":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"4484a6a186b030a1e3224507e7407bc06b4cab75d90e3c7e10565e40ec8beaf4"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_table::bind_webhook_info (cognitive 19): risingwave_frontend::handler::create_table::bind_webhook_info has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"765b8e6f7a7c83420a0f68ff2a513bd2018e18c133dd5edf9626eeed9af4d85c"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::drop_index::handle_drop_index (cognitive 19): risingwave_frontend::handler::drop_index::handle_drop_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/drop_index.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f80b8e3506aac8e8602c36e1f4cb1d87732ede0fa2b34389bf819891a1038c"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::stream_fragmenter::build_fragment (cognitive 19): risingwave_frontend::stream_fragmenter::build_fragment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/stream_fragmenter/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedb22ae6aa86f94257268beab4a5bd92388217ea87e073bead50f68de7cfd8f"}},{"ruleId":"D2","level":"warning","message":{"text":"BackfillOrderState::finish_fragment (cognitive 19): BackfillOrderState::finish_fragment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/backfill_order_control.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8aa3aee0702367a066b77c2753d65dca59a367be5a6b0dee8ee2b1fc6970d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::correct_commit_ssts (cognitive 19): HummockManager::correct_commit_ssts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (7 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":"src/meta/src/hummock/manager/commit_epoch.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"896b503cfbfa0ffb93d5287cb61da491812cf964dc24700a1ce7cb1aea31c4bb"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamFragmentGraph::collect_snapshot_backfill_info_impl (cognitive 19): StreamFragmentGraph::collect_snapshot_backfill_info_impl has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 4 (8 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c893181c785a354f2eadd140bb64e2fa26cf9a04357df9efec87ce5a0a1d1513"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::manager::iceberg_pk_index_sink::coordinator::coalesce_position_delete_files (cognitive 19): risingwave_meta::manager::iceberg_pk_index_sink::coordinator::coalesce_position_delete_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (6 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":"src/meta/src/manager/iceberg_pk_index_sink/coordinator.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff694c02a18d09d9048d322a8c8e36966d4848be7d9e8d85ff66e3fd84bfdb8"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::stream::source_manager::split_assignment::reassign_splits (cognitive 19): risingwave_meta::stream::source_manager::split_assignment::reassign_splits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/source_manager/split_assignment.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa590fa0de2e37508f559331fb9a8668390ef392a8c1fbd6a2149e983ca2f27e"}},{"ruleId":"D2","level":"warning","message":{"text":"risedev::risedev_env::generate_risedev_env (cognitive 19): risedev::risedev_env::generate_risedev_env has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/risedev_env.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eba1c9ad8297f77b040642e32f046db72057a2ef251f41f8c1e6406910a0fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_columns_with_watermark (cognitive 19): Parser::parse_columns_with_watermark has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb205f59d013df296c938e4b91bae93ab2536ce15f2d1c80ee8eeeb2d3e49da9"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsyncData::clear_tables (cognitive 19): UnsyncData::clear_tables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 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":"src/storage/src/hummock/event_handler/uploader/mod.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0672360277cb2d08911851066fe660969212438965724a2ef4c745f4b0fa352"}},{"ruleId":"D2","level":"warning","message":{"text":"PkPrefixSkipWatermarkState::advance_watermark (cognitive 19): PkPrefixSkipWatermarkState::advance_watermark has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 1 (5 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/iterator/skip_watermark.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"55923cd5deb4e33cd9bab40306987446be560eb2cccc4df02e7f3dde707caa52"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeKvStateStoreRevIter::next_inner (cognitive 19): RangeKvStateStoreRevIter::next_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"src/storage/src/memory.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d9ebec826b631b2f33d7be81929cb561a006b607a9be77887074189e245e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorIndexSnapshot::query_expand_chunk (cognitive 19): VectorIndexSnapshot::query_expand_chunk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/table/batch_table/vector_index_reader.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"be843fc837f795ea6e9425e9736feec43fe8b56974a52997338be3875dc15aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"DispatchOutputMapping::apply (cognitive 19): DispatchOutputMapping::apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dispatch/output_mapping.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54674f8a6a99ef2efd9669ffaca25cfecf53f67ecf82df798c5446498732059"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNCache::insert (cognitive 19): TopNCache::insert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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":"src/stream/src/executor/top_n/top_n_cache.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"012d3037edd04ed148fddb6762db169325d5c17ba4bde7cb7389abeb7eab0c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::from_proto::source::trad_source::create_source_desc_builder (cognitive 19): risingwave_stream::from_proto::source::trad_source::create_source_desc_builder has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 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":"src/stream/src/from_proto/source/trad_source.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57ff33a88b6df5d9d07d6615963a5eaf7fee78e9f861172dd99cc2aa845d6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkWriterStreamObserver.onNext (cognitive 19): SinkWriterStreamObserver.onNext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, error handling 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/SinkWriterStreamObserver.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"91726b6d29ad941cf9970207b61b12999f42608440d9885183e6a11189d2d380"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergScanExecutor::do_execute (cognitive 18): IcebergScanExecutor::do_execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/iceberg_scan.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c124b43e605403379f152928e680c4607d1d11642192b0516f034cf4a78cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExecutor::do_left_anti_join_with_non_equi_condition (cognitive 18): HashJoinExecutor::do_left_anti_join_with_non_equi_condition 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe923e61a47ffd602fc3f79adb89ecfa8282b8f713b30047db92ab067605eb6"}},{"ruleId":"D2","level":"warning","message":{"text":"NestedLoopJoinExecutor::do_full_outer_join (cognitive 18): NestedLoopJoinExecutor::do_full_outer_join has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/nested_loop_join.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c17a0321a6098fbf3c4d3b223c283684cad9c25c4e57199a3bc28c460baa96"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::system_param::check_missing_params (cognitive 18): risingwave_common::system_param::check_missing_params 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. This shape REPEATS in the file: one other method here (risingwave_common::system_param::validate_init_system_params) 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":"src/common/src/system_param/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ef30254daf1a9c45c692c0b250c29bbbb4627d1bf1dd04d81c7ad29fc605b9"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_common::system_param::validate_init_system_params (cognitive 18): risingwave_common::system_param::validate_init_system_params 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. This shape REPEATS in the file: one other method here (risingwave_common::system_param::check_missing_params) 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":"src/common/src/system_param/mod.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ed812f53e284257ca3903958ef33a45724acdf81a2702ea8d3c577a1087f30"}},{"ruleId":"D2","level":"warning","message":{"text":"MonitorServiceImpl::tiered_cache_tracing (cognitive 18): MonitorServiceImpl::tiered_cache_tracing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/rpc/service/monitor_service.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e009c736e4915fee0b7e74b9cdfb28701920f1e7e9f7d24dad1fab02ca9af75"}},{"ruleId":"D2","level":"warning","message":{"text":"ClickHouseSinkWriter::write (cognitive 18): ClickHouseSinkWriter::write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"src/connector/src/sink/clickhouse.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bb45277e911a8a7a47e6509cace3fa7f8906d17674caf9d915db845c288915"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamoDbPayloadWriter::write_chunk (cognitive 18): DynamoDbPayloadWriter::write_chunk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 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":"src/connector/src/sink/dynamodb.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd92d6be1f9327771b8a61053644052c48ea9ef2db9c7d24969cee54bb15601"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaPayloadWriter::send_result (cognitive 18): KafkaPayloadWriter::send_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), 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":"src/connector/src/sink/kafka.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c85c1d3b286dfac3a505571f37c2747936954bfc0e6ac1cd4695ab5ba0b2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::sqlserver::bind_params (cognitive 18): risingwave_connector::sink::sqlserver::bind_params has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (17 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/sqlserver.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"27674640746792b9af41a8570484751068f8748ae7982e3ff6e2f4cc21317c84"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::meta::cluster_info::cluster_info (cognitive 18): risingwave_ctl::cmd_impl::meta::cluster_info::cluster_info has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/meta/cluster_info.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a691a4119706756a967823653638fb1f38bba43bd1a685845060592219250a23"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::scalar::similar_to_escape::similar_escape_internal (cognitive 18): risingwave_expr_impl::scalar::similar_to_escape::similar_escape_internal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 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":"src/expr/impl/src/scalar/similar_to_escape.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed20be0e20944905e7c3dfc35702f02ec2f398fdb0399efbce76211c31375e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::check_convert_simple_form (cognitive 18): Binder::check_convert_simple_form 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":"src/frontend/src/binder/expr/mod.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ae0861e3daa1a52c9e3f100b895ebf80a8eb6fffbd720dc0b5e89dcb401af8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutorStats::get_delta (cognitive 18): ExecutorStats::get_delta 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":"src/frontend/src/handler/explain_analyze_stream_job.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf169d1bb064ce7b6a591eaa4e4c9b2296bbe352d6b7a80ae3c05867b8db9d23"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalScan::to_stream (cognitive 18): LogicalScan::to_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_scan.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"61682e3e3fe31a10f5e939017fb8a5cc2405b9c69b2d2cff619e19dd2c428b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalVectorSearch::resolve_vector_index_lookup (cognitive 18): LogicalVectorSearch::resolve_vector_index_lookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_vector_search.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcada47b09a75f89fb252ddd33a38a9932acc6de0be07c917399d9c234b3f6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexSelectionRule::gen_paths (cognitive 18): IndexSelectionRule::gen_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/index_selection_rule.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"772284f67bbd48ab22d1adca8fe6fcfd2455c5e114f9ea566ee609a93dbd55f3"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexSelectionRule::gen_index_path (cognitive 18): IndexSelectionRule::gen_index_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 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":"src/frontend/src/optimizer/rule/index_selection_rule.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"247d18ad6155046d490b3983aa4a9d4af325f5e1c87246dc771e043da1cf58f3"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManagerImpl::connect_inner (cognitive 18): SessionManagerImpl::connect_inner has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/session.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a249caba9f2e63faa7b2e53e89e601ee08be0f7ea3b1ecd2e2f9f2dd9ab881"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::explain_analyze_stream_job::graph::render_graph_with_metrics (cognitive 18): risingwave_frontend::handler::explain_analyze_stream_job::graph::render_graph_with_metrics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/explain_analyze_stream_job.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6111d9b556844f85e89aba8710f2f82ea7ccfac24950a40e420383d65f0bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_table::build_iceberg_engine_sink_options (cognitive 18): risingwave_frontend::handler::create_table::build_iceberg_engine_sink_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (4 pts), boolean chains 2 (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":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9b9b9c3e366c78d27afb836dd0216ad2d9cdfd5db72f09e0f5543db281b079"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_database::handle_create_database (cognitive 18): risingwave_frontend::handler::create_database::handle_create_database 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":"src/frontend/src/handler/create_database.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbdd5825852baf613c8c20dd9e601e4fc1af32a68b97d981386d4aa9355e81b"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::expr::type_inference::func::narrow_category (cognitive 18): risingwave_frontend::expr::type_inference::func::narrow_category has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1, 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":"src/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"98700a6094bc4cab5a14ec4c2edd882916f5e3ab2e04eb3614215249eb5f23b2"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::binder::relation::match_recognize::min_start_distances::walk (cognitive 18): risingwave_frontend::binder::relation::match_recognize::min_start_distances::walk has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9dcc7f8cd6b1d61fc8be12374400c25cc1b052e774e4c37c4575036206c1c6"}},{"ruleId":"D2","level":"warning","message":{"text":"CreatingStreamingJobControl::resolve_since_timestamp_upstream_log_epochs (cognitive 18): CreatingStreamingJobControl::resolve_since_timestamp_upstream_log_epochs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (5 pts) (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":"src/meta/src/barrier/checkpoint/independent_job/creating_job/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8157c55fe8739f11bf08611a78e5bd92668c43fd2326045f9347610665edb60e"}},{"ruleId":"D2","level":"warning","message":{"text":"RescheduleContext::into_database_contexts (cognitive 18): RescheduleContext::into_database_contexts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 7 (9 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/command.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d484c03c5c2a4f3d5e9dfd96a8569fd7e5494a9cfab824c07db893ac9599a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"ClusterController::start_heartbeat_checker (cognitive 18): ClusterController::start_heartbeat_checker has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 3 (5 pts), if/else 1 (2 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":"src/meta/src/controller/cluster.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2306358cf2b9a3345c404144b7caeac364a402f93801194c994fc01d8e70a9e2"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::apply_split_weight_by_vnode_partition (cognitive 18): HummockManager::apply_split_weight_by_vnode_partition has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (5 pts), boolean chains 4 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbb787554077754941e66ef78f4590e6cef8f902b3100d4673ec62928a59176"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockManager::commit_epoch_sanity_check (cognitive 18): HummockManager::commit_epoch_sanity_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, 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":"src/meta/src/hummock/manager/context.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a588c20b39b680d4d4017529207f6fbb419665ac40b07398e81b6a68ecfa95"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnoseCommand::write_worker_nodes (cognitive 18): DiagnoseCommand::write_worker_nodes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (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":"src/meta/src/manager/diagnose.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b1ef85f19737e228666484f5f698abd07e7acff9af2ddc75b368711440c197"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::hummock::manager::compaction::compaction_group_manager::update_compaction_config (cognitive 18): risingwave_meta::hummock::manager::compaction::compaction_group_manager::update_compaction_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_group_manager.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a6a1d4ab24e71da5444a742a302685c45bfbf27bee218c168019b9320b7a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::barrier::checkpoint::state::render_actors (cognitive 18): risingwave_meta::barrier::checkpoint::state::render_actors has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), 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":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7448d1acbf054180ca3fd126e9dbcb524f0cd03531bacaa74b5cc0837ea421d3"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::stream::stream_graph::assignment::assign_hierarchical (cognitive 18): risingwave_meta::stream::stream_graph::assignment::assign_hierarchical has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (7 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/assignment.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"834c4079174d32df08f98cda108d19597bd84778b5292ac90e89bd760a26d5b0"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::stream::scale::build_reschedule_commands (cognitive 18): risingwave_meta::stream::scale::build_reschedule_commands has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), match/switch 1 (4 pts), if/else 2 (3 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":"src/meta/src/stream/scale.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb53b256cdf19390a0d7c2a2fd295a5a495d709c63fdbff1e293943d1fc6d11"}},{"ruleId":"D2","level":"warning","message":{"text":"risedev::bin::risedev-docslt::extract_slt (cognitive 18): risedev::bin::risedev-docslt::extract_slt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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":"src/risedevtool/src/bin/risedev-docslt.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"946bca62cb08bc05da43305daa8daae61a9b72da5cf2343535bfd10c29b4b602"}},{"ruleId":"D2","level":"warning","message":{"text":"GrpcMetaClient::start_meta_member_monitor (cognitive 18): GrpcMetaClient::start_meta_member_monitor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rpc_client/src/meta_client.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baab2dc714b721eb1349838beccb6de3e9239e962b407587e7268c7f5bad00d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_optional_table_constraint (cognitive 18): Parser::parse_optional_table_constraint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":2983}}}],"partialFingerprints":{"codehealthFindingId/v1":"505852034df50118645f8ebb3e6ca9437dac85bd7031df65d4a55d17af93171d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter (cognitive 18): Parser::parse_alter 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4678b0411f93e90678396b56303d6f0e8ee30ebd42cdebbadfab4a3c9eb4a52c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_query (cognitive 18): Parser::parse_query has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":4914}}}],"partialFingerprints":{"codehealthFindingId/v1":"974fcd01095926b8e123d088ca2b52f1248cdaeb406e77b77251daa81d7d80dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_grant_revoke_privileges_objects (cognitive 18): Parser::parse_grant_revoke_privileges_objects has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 1 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":6182}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ce9662356b60fd850cfe74cd3160bad980201c2606ab8cd8fba0839ab1f7d4"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::iterator::filter_block_metas (cognitive 18): risingwave_storage::hummock::compactor::iterator::filter_block_metas has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/iterator.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fea3a151096cde484f4ed77900b23c56e5d4d45319d726d1d6a42b67274451"}},{"ruleId":"D2","level":"warning","message":{"text":"StateTableRowStore::iter_kv (cognitive 18): StateTableRowStore::iter_kv 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. This shape REPEATS in the file: one other method here (StateTableRowStore::rev_iter_kv) 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":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"197c422cdf52767cf74d7a5fcad2bbc7881c3fb346cfb1a1ad9df4b25e227a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"StateTableRowStore::rev_iter_kv (cognitive 18): StateTableRowStore::rev_iter_kv 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. This shape REPEATS in the file: one other method here (StateTableRowStore::iter_kv) 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":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e17946cc95d1ebf4b77530d95fdf8ee5e4742eb962d0210f7cc5c1cdec51c4b"}},{"ruleId":"D2","level":"warning","message":{"text":"VnodeStream::poll_next (cognitive 18): VnodeStream::poll_next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/snapshot_backfill/vnode_stream.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"220a006eab9a6b32ff58bf57a6a7d43092c2c422e3cf8ff462a409cad0639f40"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeExecutorInner::execute_inner (cognitive 18): MergeExecutorInner::execute_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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":"src/stream/src/executor/merge.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44e279ae162602477fa067a1083d403dd9e589ebb5af95e37b1a28d31ac0e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializeCache::fetch_keys (cognitive 18): MaterializeCache::fetch_keys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mview/cache.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"599b8e7feca068fa173aeaef912e81550e9c9577ea4557e6ed2ec4f3b068dd2e"}},{"ruleId":"D2","level":"warning","message":{"text":"RowMergeExecutor::build_chunk (cognitive 18): RowMergeExecutor::build_chunk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/row_merge.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"627821f271226a4d48773a8ebe1823828dab5ba5252b18eb9dea083e3dfc6848"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::over_window::frame_finder::find_curr_for_rows_frame (cognitive 18): risingwave_stream::executor::over_window::frame_finder::find_curr_for_rows_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 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, and where an else follows 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/stream/src/executor/over_window/frame_finder.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e15d87c408cd7e7bfc74683008ea337ab429c93e38779df2f7cb435b59aab6a"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::temporal_join::align_input (cognitive 18): risingwave_stream::executor::temporal_join::align_input has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 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":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5aca3d47f0655c378b36c13f18fbeaa212b95b1b517cea970c121ad9ba2e51"}},{"ruleId":"D2","level":"warning","message":{"text":"LdapConfig::from_ldap_url (cognitive 18): LdapConfig::from_ldap_url has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows 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/utils/pgwire/src/ldap_auth.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47339c9b47265f764580c56cd18550b9a096f025080b1de37a0463e75b431b6"}},{"ruleId":"D2","level":"warning","message":{"text":"PgProtocol::do_process (cognitive 18): PgProtocol::do_process has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44d22b0e5a578215d96eea4f77780ac9feab7d99954fbd522c508c6293b2a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresStreamingChangeEventSource.processReplicationMessages (cognitive 18): PostgresStreamingChangeEventSource.processReplicationMessages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eab0792fee885f9765baa4f811598c4bb5146a2570a6e15e6e20a617a4ec100"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresValidator.validatePrivileges (cognitive 18): PostgresValidator.validatePrivileges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da02ad1c9122f884a959032e430d2cf22563617b8a9ec40a5ffa445e65f0aff"}},{"ruleId":"D2","level":"warning","message":{"text":"HopWindowExecutor::do_execute (cognitive 17): HopWindowExecutor::do_execute 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":"src/batch/executors/src/executor/hop_window.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82d956f5d1eecffa0cba105029f09a3e58e78203e39d57b827d9b097f9d2387"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeSortExecutor::do_execute (cognitive 17): MergeSortExecutor::do_execute has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 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":"src/batch/executors/src/executor/merge_sort.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5117c54b59d3993dec849bed09bf18135643f8b2a379e260ad066e5070ba867d"}},{"ruleId":"D2","level":"warning","message":{"text":"MonitorServiceImpl::stack_trace (cognitive 17): MonitorServiceImpl::stack_trace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 2, 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":"src/compute/src/rpc/service/monitor_service.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d232df5eb0559218a3645eafcf92de11269a305a53a0224571d07ab025921a50"}},{"ruleId":"D2","level":"warning","message":{"text":"RateLimitedLogReader::truncate (cognitive 17): RateLimitedLogReader::truncate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (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":"src/connector/src/sink/log_store.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad833c325aaef40d2ed96dc040b28231cd596b1bb0e160d39e935281203303f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveryFutureManager::next_truncate_offset (cognitive 17): DeliveryFutureManager::next_truncate_offset has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (11 pts), loops 2 (4 pts), if/else 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/log_store.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39f846074952896c2af2497d3f7bfe0a4d647082f3f8cdb688bdb79b289f0b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresExternalTableReader::split_filter_expression (cognitive 17): PostgresExternalTableReader::split_filter_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7b73849d7e166518aac992b807877002c941cc7150ffea1dd77c202e75736c"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::hummock::compaction_group::list_compaction_status (cognitive 17): risingwave_ctl::cmd_impl::hummock::compaction_group::list_compaction_status has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/hummock/compaction_group.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ff65aa97739dbbd8b9620e72cd0719d3e83f3d52266d10f8416ae4aad5aae2"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::bench::do_bench (cognitive 17): risingwave_ctl::cmd_impl::bench::do_bench has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 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":"src/ctl/src/cmd_impl/bench.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f369924c0cf23bf1ab6ab54174ba29f36f2155dd3472b727123a0f40c42d9dee"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_ctl::cmd_impl::hummock::migrate_legacy_object::migrate_legacy_object (cognitive 17): risingwave_ctl::cmd_impl::hummock::migrate_legacy_object::migrate_legacy_object 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":"src/ctl/src/cmd_impl/hummock/migrate_legacy_object.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"98462eed323bcc511b4e0124c7e16ec338dd03341676a66f079ae863e265455c"}},{"ruleId":"D2","level":"warning","message":{"text":"Formatter::from_str (cognitive 17): Formatter::from_str 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":"src/expr/impl/src/scalar/format.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b8fb0deb53ce45eb91df304f012326b55048e435a7fd15b2fa05ab3ebb2540"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_impl::window_function::range_utils::range_diff (cognitive 17): risingwave_expr_impl::window_function::range_utils::range_diff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/window_function/range_utils.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0196b25a43866a7f2573383deeda5c0a04b6d5bb16485cada11566845fc98814"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_expr_macro::context::generate_captured_function (cognitive 17): risingwave_expr_macro::context::generate_captured_function has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 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":"src/expr/macro/src/context.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb623b7a553a23a4561533b65360f46813149b9e6cfd0a394a5a8db23487d037"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_expr_inner (cognitive 17): Binder::bind_expr_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"100c4dad817b3e2d5c8aea87f60af5a22b1079216f77f515aaf0427d766e36bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::check_constant_case_when_optimization (cognitive 17): Binder::check_constant_case_when_optimization has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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/frontend/src/binder/expr/mod.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"7236282a1761791404c08ccd62fd9d1b631956e091ba362bd2a48ca548630f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"AggGroupBySimplifyRule::apply (cognitive 17): AggGroupBySimplifyRule::apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 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":"src/frontend/src/optimizer/rule/agg_group_by_simplify_rule.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1619aa58df084119e7e47849bc11538d467a6c6c46b8173740532df17aec0737"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexDeltaJoinRule::apply::match_indexes (cognitive 17): IndexDeltaJoinRule::apply::match_indexes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/index_delta_join_rule.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"612732fd7b85c4da9ae62f2a2d717cf310feb0913892d4c6ba35fad6252b7ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"MvSelectionRule::inner_join_rewrite (cognitive 17): MvSelectionRule::inner_join_rewrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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/frontend/src/optimizer/rule/mv_selection_rule.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a096809bab645b46d037c1c7439214079699a4c306f13902307db1f2eb13752d"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::alter_system::handle_alter_system (cognitive 17): risingwave_frontend::handler::alter_system::handle_alter_system has cognitive complexity 17 (threshold 15). Drivers by points: if/else 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":"src/frontend/src/handler/alter_system.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80a48a08b96e0ad6d553d9c1813a0bb45ee7a8ae721bae06586c7944957a407"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::utils::with_options::resolve_source_refresh_mode_in_with_option (cognitive 17): risingwave_frontend::utils::with_options::resolve_source_refresh_mode_in_with_option has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/with_options.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"802c54d517dbb32f92278c65756fe850092e6ff8a9dc7790208b26d6b80b19b2"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::handle_privilege::handle_alter_default_privileges (cognitive 17): risingwave_frontend::handler::handle_privilege::handle_alter_default_privileges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3, boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/handle_privilege.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc0205850b17a49cc89a8b932ebb8ce6cfa6a00947997dfc43e23e22eda91bb"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::clean_dirty_creating_jobs (cognitive 17): CatalogController::clean_dirty_creating_jobs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 3 (5 pts), boolean chains 4 (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/meta/src/controller/catalog/mod.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16f424e4849cee37fd6a468dbdc36c690a5982c2d1e2d99e4a2fa97b2a5bc66"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::grant_privilege (cognitive 17): CatalogController::grant_privilege has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/user.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"296168f08afc27344c18b1fd9cc8530a9679cd4ad3aa9e6b590303c6dfebba67"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualCompactionPicker::pick_compaction (cognitive 17): ManualCompactionPicker::pick_compaction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/picker/manual_compaction_picker.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed75b2a34d00285f6ae92bbd1fc7559ec652feaf552027a1364163b8723566c"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnoseCommand::write_storage (cognitive 17): DiagnoseCommand::write_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into 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/meta/src/manager/diagnose.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5eea8a52c689436c23fe00a4eaa9b0b45a85f9776fb7fb6e4278c153da6ae64"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalRefreshManager::tick (cognitive 17): GlobalRefreshManager::tick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2, 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":"src/meta/src/stream/refresh_manager.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"475bd0387d1e23f0970a30f8d7a8c3a5253a36b20d0b491028d17670525d6465"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceManager::validate_inject_source_offsets (cognitive 17): SourceManager::validate_inject_source_offsets has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 6 (8 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/source_manager.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bf9a224d500b8063c533343b9079a158678a776cd8cb404d1d75dac29091a5"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalStreamManager::create_streaming_job (cognitive 17): GlobalStreamManager::create_streaming_job has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (7 pts), loops 1 (2 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":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf84e94618fb4576156f309c0fc128d27f34c71be40e1ccb16814400826a629"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::barrier::checkpoint::state::resolve_no_shuffle_ensembles (cognitive 17): risingwave_meta::barrier::checkpoint::state::resolve_no_shuffle_ensembles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a301e546c8e2a54d5f15ad6f97718b5c5452722af1848be9990bc8bfaede9007"}},{"ruleId":"D2","level":"warning","message":{"text":"risedev::wait::wait (cognitive 17): risedev::wait::wait 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":"src/risedevtool/src/wait.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d022d78ad08bb9cee33e499310fbe7de504883511ca9908c5f29b4fa0682612"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_set (cognitive 17): Parser::parse_set has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (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":"src/sqlparser/src/parser.rs"},"region":{"startLine":5173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b609f721dd4b5899876fc65445384f4e5ce2edaa656a50c867e14bdc8885b15"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueSkipWatermarkState::should_delete (cognitive 17): ValueSkipWatermarkState::should_delete has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 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":"src/storage/src/hummock/iterator/skip_watermark.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f744adc7f6b95c2083319c2ada7de858e0133f9face2ff50b95f0b608b89d3c9"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalApproxPercentileState::apply_row (cognitive 17): GlobalApproxPercentileState::apply_row has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/approx_percentile/global_state.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"23140d54aa533cbf14db4ead9644fd6632e87817c98bd5b075e5bc98c9beb674"}},{"ruleId":"D2","level":"warning","message":{"text":"RowIdGenExecutor::gen_row_id_column_by_op (cognitive 17): RowIdGenExecutor::gen_row_id_column_by_op has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (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":"src/stream/src/executor/row_id_gen.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e347304c4ec9479fde08dc3b7459227de84e057557d2ad92747c416b8c7591"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamReaderBuilder::setup_auto_schema_change (cognitive 17): StreamReaderBuilder::setup_auto_schema_change has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/reader_stream.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"811e82e26874250c296da4089a724137918368f2d769418d23a1173208732e61"}},{"ruleId":"D2","level":"warning","message":{"text":"WaitCheckpointWorker::run (cognitive 17): WaitCheckpointWorker::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), 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":"src/stream/src/executor/source/source_executor.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be3d8395672b6a9914efd3e4eec6440b76097bc6bddb98df3957922726b779"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalBarrierWorker::add_partial_graph (cognitive 17): LocalBarrierWorker::add_partial_graph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/stream/src/task/barrier_worker/mod.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"00640f1fadb8fd3281e679e22e6e76d52034514d1b03fe4a98af50e0cc57f70f"}},{"ruleId":"D2","level":"warning","message":{"text":"cpu_profiling.CpuProfiling (cognitive 17): cpu_profiling.CpuProfiling has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (5 pts), boolean chains 4, if/else 4, error handling 2 (3 pts), loops 1 (nesting depth added 3). Of this number, 10 points are the body\u0027s own statements and 7 belong to 4 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":"dashboard/pages/cpu_profiling.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdc9699d5d8cc27bfa2ba7c5bef31068c4dd399f8b2925b952278b92513fc69"}},{"ruleId":"D2","level":"warning","message":{"text":"DataChunkMutator::remove_duplicate_rows_for_full_outer_join (cognitive 16): DataChunkMutator::remove_duplicate_rows_for_full_outer_join has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"46346983ddfc2b601b2d0c470cbda8ebfac23f47072af65980276d6fd469a500"}},{"ruleId":"D2","level":"warning","message":{"text":"Interval::fmt (cognitive 16): Interval::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/types/interval.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"f889eb5baed048c3caa789fb05a6810bc62a7901649238c0c7e4770abd6a1eba"}},{"ruleId":"D2","level":"warning","message":{"text":"DataChunkBuilder::append_chunk_inner (cognitive 16): DataChunkBuilder::append_chunk_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/chunk_coalesce.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ad68b790319fed546e379824524bc8fdd0f9087cddf10d05f718f4f639a02f"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigServiceImpl::resize_cache (cognitive 16): ConfigServiceImpl::resize_cache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/rpc/service/config_service.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee236893f7e5326171dc6e23c77ffc2966f7491d2a1ca63dd93f6a395c807ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvParser::parse_inner (cognitive 16): CsvParser::parse_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/csv_parser.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d789742d9dfaff9f3baa51e89e66987c168288b0487351054f1d1c0a26497051"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaSplitReader::new (cognitive 16): KafkaSplitReader::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2, 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":"src/connector/src/source/kafka/source/reader.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd9157ece381c357643a95fa0e400b0b1a8145acd6a5133195e9ffe210fce80"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::parser::mysql::mysql_datum_to_rw_datum (cognitive 16): risingwave_connector::parser::mysql::mysql_datum_to_rw_datum has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 1 (2 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/mysql.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb2be00c14d0cbd815f3b8f18718c6289590bc130b9d1fbf1203d9b5b20af75"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_connector::sink::encoder::bson::datum_to_bson (cognitive 16): risingwave_connector::sink::encoder::bson::datum_to_bson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 4 (6 pts), loops 1 (2 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":"src/connector/src/sink/encoder/bson.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374498f581b26a96eab9d82c5abf6ef61430a8a93c05fc1b24211f3ef822cec"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprError::function (cognitive 16): ExprError::function has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), match/switch 1 (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":"src/expr/core/src/error.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"deca75103e09e46aba20d1813dbc40d9e95d1f78290388b6657c22b51d2a58cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::correlation_contexts (cognitive 16): Binder::correlation_contexts 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":"src/frontend/src/binder/expr/column.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae7e4c430be70945615df9bde081ed4eb7a5ef5f0a0054bb4b84dc443089ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder::bind_ordered_set_agg (cognitive 16): Binder::bind_ordered_set_agg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/function/aggregate.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bb993c97222455781c7412e38694eb9a20c3b560de5cacbe3aea8a3fb5728b"}},{"ruleId":"D2","level":"warning","message":{"text":"EitherOnConflict::to_behavior (cognitive 16): EitherOnConflict::to_behavior has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), boolean chains 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":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"9740bfb03652b529956a0abf24adf33d3b38aa0b9310c51b3e3250a293ad2ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexSelectionRule::apply (cognitive 16): IndexSelectionRule::apply 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":"src/frontend/src/optimizer/rule/index_selection_rule.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b80a2cc1f9973d2193999a661b5cd232e15dd473f973be19ff2f9d31c1ce99f"}},{"ruleId":"D2","level":"warning","message":{"text":"PushCalculationOfJoinRule::find_comparison_exprs (cognitive 16): PushCalculationOfJoinRule::find_comparison_exprs 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":"src/frontend/src/optimizer/rule/push_calculation_of_join_rule.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce85bb3d4df5b22121ca97334425af7899076b612dd0adaf73f785e3c718842a"}},{"ruleId":"D2","level":"warning","message":{"text":"TableFunctionToFileScanRule::apply (cognitive 16): TableFunctionToFileScanRule::apply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 2 (6 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/table_function_to_file_scan_rule.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b70036d8667027e4a5ce20a874dcf7af258ee1fb1868b14087cc92def0f985"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNToVectorSearchRule::resolve_vector_search (cognitive 16): TopNToVectorSearchRule::resolve_vector_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2, boolean chains 1, 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":"src/frontend/src/optimizer/rule/top_n_to_vector_search_rule.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"50eec8fe278fbc1e9599a29d94d513f943f9dfa8f33fcb2cb32e2c02ccfcee45"}},{"ruleId":"D2","level":"warning","message":{"text":"Condition::split_by_input_col_nums (cognitive 16): Condition::split_by_input_col_nums has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3600d6bf4be69ff726005b2ce347325a3978c4b78db135dd3adabdb62ff84256"}},{"ruleId":"D2","level":"warning","message":{"text":"WithOptions::try_from (cognitive 16): WithOptions::try_from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (4 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":"src/frontend/src/utils/with_options.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e71ae095f7301e838fc23c67b5fb7e4e76a22220990efe5f2b9b6d229223133"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::catalog::system_catalog::rw_catalog::rw_backfill_info::extract_stream_scan (cognitive 16): risingwave_frontend::catalog::system_catalog::rw_catalog::rw_backfill_info::extract_stream_scan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_backfill_info.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f281779a05944299a8f820975af8b358e1be8ff517da484a07ca029c277ef"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::show::handle_show_object (cognitive 16): risingwave_frontend::handler::show::handle_show_object has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 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":"src/frontend/src/handler/show.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f37ac4020c268cdcc9df970b7d954f539b8b222da926e9cec88031533e6d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_frontend::handler::create_source::handle_create_cdc_table_source (cognitive 16): risingwave_frontend::handler::create_source::handle_create_cdc_table_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (4 pts), boolean chains 2, match/switch 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/frontend/src/handler/create_source.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7815ba2c8b4ebaf3c6a4ba22fc7e0b19c0ee87d55bea695e581689fa35e44f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::post_collect_job_fragments (cognitive 16): CatalogController::post_collect_job_fragments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dd549762ee7abb25227b96a83f4b8fbcc756d0d6db89578e65e6c7a05606a9"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogController::finish_streaming_job_inner (cognitive 16): CatalogController::finish_streaming_job_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (7 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22849a947d2a0ef935679dd1daaedd5333b5ccacaa08b84312ab0d19f8f76d9"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadedFragmentContext::into_database_contexts (cognitive 16): LoadedFragmentContext::into_database_contexts 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":"src/meta/src/controller/scale.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"88777ad485412a317de7a24ca6431610a3fb7a8299cd56c11c39c79845cf0b94"}},{"ruleId":"D2","level":"warning","message":{"text":"TierCompactionPicker::pick_overlapping_level (cognitive 16): TierCompactionPicker::pick_overlapping_level 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":"src/meta/src/hummock/compaction/picker/tier_compaction_picker.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8301c64dd8b91a8d0292b783e9e25fd0c50c7acbedc9624b3fc5ee2cd746574"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicLevelSelectorCore::compact_pending_bytes_needed_with_ctx (cognitive 16): DynamicLevelSelectorCore::compact_pending_bytes_needed_with_ctx has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/selector/level_selector.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7e1376b0f5fe36db50a144f69a4d03e676e5afb4c0f987d2321f3500be42d8"}},{"ruleId":"D2","level":"warning","message":{"text":"MockHummockMetaClient::subscribe_compaction_event (cognitive 16): MockHummockMetaClient::subscribe_compaction_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 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":"src/meta/src/hummock/mock_hummock_meta_client.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3a222345ad8acbaf4d078f78b2a0e7b1c6f9c5c1c7bb59f5e6d5d42c295bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"TwoPhaseCommitHandler::next_to_commit (cognitive 16): TwoPhaseCommitHandler::next_to_commit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/sink_coordination/coordinator_worker.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a2d2129a0d2d6a8e9aaa8688eb79d9577ff7a704676df6300187115dbc159"}},{"ruleId":"D2","level":"warning","message":{"text":"DdlController::build_replace_job (cognitive 16): DdlController::build_replace_job has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), match/switch 2 (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":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8f7b719c796caf78d05646b78377b11bee5f8c8b8e2d9f05d2a0945933950"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalStreamManager::run_create_streaming_job_command (cognitive 16): GlobalStreamManager::run_create_streaming_job_command has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d257b0606164f70760b606a02f2ab6d5f1803f17f7f457e4ff16972bf45750"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::stream::stream_graph::fragment::rewrite_refresh_schema_sink_fragment (cognitive 16): risingwave_meta::stream::stream_graph::fragment::rewrite_refresh_schema_sink_fragment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef75d0e5ba71b6b4c6c08aff05242639807ebcf0d322d13c02d54b64d7b370c2"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::manager::iceberg_pk_index_sink::coordinator::probe_committed_data_files (cognitive 16): risingwave_meta::manager::iceberg_pk_index_sink::coordinator::probe_committed_data_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/iceberg_pk_index_sink/coordinator.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ccd37c51ee3f754d3bc69921edc1d8a6976592782bdef0418386a4c1838b36"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_meta::stream::stream_graph::assignment::assign_items_weighted_with_scale_fn (cognitive 16): risingwave_meta::stream::stream_graph::assignment::assign_items_weighted_with_scale_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/assignment.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14def173e9e5c83a4db9f9ed7ff20c7cde2ce27184b995570960ca694b7e12c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_subscription (cognitive 16): Parser::parse_alter_subscription has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45fd849ae4bfb0313b43a9b87fd5a963a4d254d85ddd9dc0031b07b8155684a"}},{"ruleId":"D2","level":"warning","message":{"text":"HummockVersionStateTableInfo::apply_delta (cognitive 16): HummockVersionStateTableInfo::apply_delta has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/version.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e200f1cc57b3d85912d93825ec88b64ac8cc15a12a36a9950bdb300c949dded"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheRefillTask::data_cache_refill (cognitive 16): CacheRefillTask::data_cache_refill has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 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":"src/storage/src/hummock/event_handler/refiller.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61b6605b3195eaad648459efdafcc240b31f0bcc35291cf80c4e14420f0e258"}},{"ruleId":"D2","level":"warning","message":{"text":"UploaderData::may_notify_sync_task (cognitive 16): UploaderData::may_notify_sync_task has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/event_handler/uploader/mod.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"9268867c224be94498f4949eb4fc1802442c5573f0955e5ba42330363ad9f66d"}},{"ruleId":"D2","level":"warning","message":{"text":"MemTable::delete (cognitive 16): MemTable::delete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/mem_table.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbecd5ab51fc756b0dcf3bd76e23128b2827f9b443a328bb6a5f7fb73f987265"}},{"ruleId":"D2","level":"warning","message":{"text":"MemTable::update (cognitive 16): MemTable::update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/mem_table.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db038a2d443cf0de254d9c84b470c90d437c1eca5c18c624042f5bac7410034"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_storage::hummock::compactor::compaction_utils::generate_splits (cognitive 16): risingwave_storage::hummock::compactor::compaction_utils::generate_splits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compaction_utils.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"07150dcd2cd375091e7143eb46fc043604a0c95fc6a16268573be35517644d18"}},{"ruleId":"D2","level":"warning","message":{"text":"LogStoreRowSerde::deserialize_stream_chunk (cognitive 16): LogStoreRowSerde::deserialize_stream_chunk 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":"src/stream/src/common/log_store_impl/kv_log_store/serde.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d92ffdc0cfaeb184b12850df5887888f10a5167437ca5c9385ea4f273353c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"StateTableBuilder::build_inner (cognitive 16): StateTableBuilder::build_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa4ea5205e58f02a8b1eeb496271b6773f320181979c4f3cc66eb8bcc09580e"}},{"ruleId":"D2","level":"warning","message":{"text":"HashDataDispatcher::dispatch_data (cognitive 16): HashDataDispatcher::dispatch_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 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":"src/stream/src/executor/dispatch.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6e9bbe15df964cb83ff131aa052247c083e609bfaf12f9e75f0124d48521fa"}},{"ruleId":"D2","level":"warning","message":{"text":"SortExecutor::executor_inner (cognitive 16): SortExecutor::executor_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/eowc/sort.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b0bf9ade8874e8ec476082bd89252e3c160bc4082068d19d35d879c634a480"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceBackfillExecutorInner::update_state_if_changed_forward_stage (cognitive 16): SourceBackfillExecutorInner::update_state_if_changed_forward_stage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (7 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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5d4c25eef28a955fb2290ab0a4462a5a871169b7024248c1d66c955ea8f163"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadFuture::next_message (cognitive 16): ReadFuture::next_message has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), loops 2 (4 pts), if/else 1 (3 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/sync_kv_log_store.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c502ffaa3b9b535d8dd0dd5d1b8a72402d9b888854f80262b96dc85e44b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNExecutorWrapper::top_n_executor_execute (cognitive 16): TopNExecutorWrapper::top_n_executor_execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 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":"src/stream/src/executor/top_n/utils.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f898aa451cb6efbecceafaae0099329d44e44b003aed50cd3cf0b51f2d5b67"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::lookup::sides::stream_lookup_arrange_prev_epoch (cognitive 16): risingwave_stream::executor::lookup::sides::stream_lookup_arrange_prev_epoch has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (6 pts), if/else 2 (5 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":"src/stream/src/executor/lookup/sides.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"901012e8ea5a8d7f8359a1b0fe560c46f4b20b723920df032c256beefee96ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::iceberg_with_pk_index::compaction_resolver::collect_input_dvs (cognitive 16): risingwave_stream::executor::iceberg_with_pk_index::compaction_resolver::collect_input_dvs 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":"src/stream/src/executor/iceberg_with_pk_index/compaction_resolver.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7bd2e231f8905717dacf2fafd1bf5041dbd9361229f90d81dc6f01cd2d5712"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::dispatch::try_batch_barriers (cognitive 16): risingwave_stream::executor::dispatch::try_batch_barriers 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":"src/stream/src/executor/dispatch.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"53276b65abb8e7a88b6e66a0d15f4d7eb59da5ad49c6d7b38069263f259d6394"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_stream::executor::iceberg_with_pk_index::position_delete_handler_impl::seed_from_delete_manifests (cognitive 16): risingwave_stream::executor::iceberg_with_pk_index::position_delete_handler_impl::seed_from_delete_manifests 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":"src/stream/src/executor/iceberg_with_pk_index/position_delete_handler_impl.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"983da854c066d8e9eff78b9dd3a8de3b56f7f6bb5413d95c7d603af5a8ac8cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"risingwave_rt::main_okk (cognitive 16): risingwave_rt::main_okk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/runtime/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da7784546be162f52055765522be5842490116b07c3d5532d45d7166b2eec24"}},{"ruleId":"D2","level":"warning","message":{"text":"MongoDbValidator.validateUserPrivilege (cognitive 16): MongoDbValidator.validateUserPrivilege has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MongoDbValidator.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc3845ce5a86ec8582b90d285debba125b340da04c73cd4e78ed6200a312a11"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 4471 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 248 methods. The bar is 400 significant lines; this is 4071 over it, 11.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":"src/sqlparser/src/parser.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9bca772e443484427866936e737859f7de884123e0c735640fbf1ee9f667f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::handle: FunctionTooLong \u2014 risingwave_frontend::handler::handle runs 1105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1005 over it, 11.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"339f0a1c1137da3d4fb08b9dc3a183544282f6404fb1d97d89544a76d1532f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseCheckpointControl.apply_command: MethodTooLong \u2014 apply_command runs 1039 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 939 over it, 10.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":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52aa0c9f78c2067db920b458405b2ddb956745c57ef958d4c01b8fba329217e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamingMetrics.new: MethodTooLong \u2014 new runs 1000 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 900 over it, 10.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":"src/stream/src/executor/monitor/streaming_stats.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a196c835a414e47cc70ac67eda508d2129a00c3b04f04afa20a3a5838c3da9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 4594 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: Parser (198-6878). The bar is 500 significant lines; this is 4094 over it, 9.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f947f6b4c87305c2c5ac0ba2c982f643dbb9d5a246cd47f3b04290ab667a87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Migration.up: MethodTooLong \u2014 up runs 859 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 759 over it, 8.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":"src/meta/model/migration/src/m20230908_072257_init.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0000e5dade18ed1bfa3701d2497b511d669257e96e8dd28204d4216e3633a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 248 methods, declared across 2 files: src/parser.rs (245), ast/statement.rs (3). The bar is 30 methods; this is 218 over it, 8.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":"src/sqlparser/src/parser.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7b718e09b8b80225f4370d21c06f70d19cf21ae2341a2c6e3d1ec8afd82e7b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CatalogController: TooManyMethods \u2014 220 methods, declared across 10 files: controller/fragment.rs (59), catalog/get_op.rs (38), controller/streaming_job.rs (31), catalog/list_op.rs (28), \u002B6 more file(s). The bar is 30 methods; this is 190 over it, 7.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcee274116bb0eaa67a91ec1809750bfbd41d9ce2421c2d858cc53d777926e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetaMetrics.new: MethodTooLong \u2014 new runs 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 543 over it, 6.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":"src/meta/src/rpc/metrics.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3c836912cb8b0a0ed5c4b212c884bccfafcc6e687800a21fecb15aa5dc9885"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Statement.fmt_unchecked: MethodTooLong \u2014 fmt_unchecked runs 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) in one body. The bar is 100 significant lines; this is 524 over it, 6.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":"src/sqlparser/src/ast/mod.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"87624bd270a6f7f977d1d73147d21f2571728f53c322df76267c7f1010896a36"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Binder: TooManyMethods \u2014 187 methods, declared across 32 files: expr/mod.rs (34), binder/mod.rs (28), relation/mod.rs (19), function/mod.rs (15), \u002B28 more file(s). The bar is 30 methods; this is 157 over it, 6.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":"src/frontend/src/binder/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaf5e50bcbe8f5f7fbbb91d1671cd7a01f25dbae15d40f65f4909434678d3de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_builtin_scalar_function: MethodTooLong \u2014 bind_builtin_scalar_function runs 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) in one body. The bar is 100 significant lines; this is 498 over it, 5.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":"src/frontend/src/binder/expr/function/builtin_scalar.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"63da1e26ad11d930cb3869777126ad836cc6e0d3e49f225315a8ae5b4449f923"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controller/streaming_job.rs: FileTooLong \u2014 2988 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: CatalogController (241-3922). The bar is 500 significant lines; this is 2488 over it, 5.98\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"559d7f295a7e4b1b5051bb479ac46b89874a4695fe6dd25c2c8ae9c46f3c9d74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/mod.rs: FileTooLong \u2014 2657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2157 over it, 5.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":"src/sqlparser/src/ast/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9559c77106f32b9d252c9e62174eb9951272ee35c1c3febfe69a3235863978"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MetaClient: TooManyMethods \u2014 152 methods. The bar is 30 methods; this is 122 over it, 5.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":"src/rpc_client/src/meta_client.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"744a67cc838965317087dad99e4a254e2ee2bec0959f49483fad3e5dd22b68c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParallelizedCdcBackfillExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 380 over it, 4.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"657b6e173315d680dbe2642b12d48b7928c218ab47c363f6ac825ae06259071e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialGraphRecoverer.inject_database_initial_barrier: MethodTooLong \u2014 inject_database_initial_barrier runs 468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 368 over it, 4.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":"src/meta/src/barrier/rpc.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a2894f1b16d4962fe297dc1b6d9ec2e59d23186f8f47f57a69019f301a6f32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CdcBackfillExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b590a9ab83bc0f6e9321f62b3d572bcc461ea8859bc6a3239f0344d379fda6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StreamingMetrics: TooManyFields \u2014 137 stored fields beside 18 methods. The bar is 30 stored fields; this is 107 over it, 4.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":"src/stream/src/executor/monitor/streaming_stats.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abe354191808eb89d37ac75871968aac169f3f8581da5415cc771d8f4cb294b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HummockManager: TooManyMethods \u2014 131 methods, declared across 16 files: compaction/mod.rs (29), manager/versioning.rs (14), manager/mod.rs (12), compaction/compaction_group_manager.rs (11), \u002B12 more file(s). The bar is 30 methods; this is 101 over it, 4.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6699114fcf7b1b7202539d7b9eef6ea798551b7abbbb24025f205a0aeeed8bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/meta_client.rs: FileTooLong \u2014 2155 significant 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: MetaClient (4 blocks, 141-2286). The bar is 500 significant lines; this is 1655 over it, 4.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":"src/rpc_client/src/meta_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bc08fa5df4febf1759f6a64298cfd16262f05633959df3463019d48bdf8e10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockStateStoreMetrics.new: MethodTooLong \u2014 new runs 427 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 327 over it, 4.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":"src/storage/src/monitor/hummock_state_store_metrics.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"42561d631fe703c50658023c510417324c9406d6ebf4af4de516ee1fbbb52f6f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DdlController: ClassTooLong \u2014 1608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 2 blocks, lines 283-2519. The bar is 400 significant lines; this is 1208 over it, 4.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"96382efa5bc4bed696262ef1448537b354124ee970b041acd6b5c8010a9c64e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta_node::server::start_service_as_election_leader: FunctionTooLong \u2014 risingwave_meta_node::server::start_service_as_election_leader 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":"src/meta/node/src/server.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b787dc22d9596ba3667b6d698812e7dd4059a5be6e0a45c29d6e8a54e67642f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetaClient: ClassTooLong \u2014 1591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 152 methods, 4 blocks, lines 141-2286. The bar is 400 significant lines; this is 1191 over it, 3.98\u00D7 the bar. To reduce it, group the members that share the 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/rpc_client/src/meta_client.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f633e089030c8c6beb2914ce571ab8381d311c529534914c336a0ef46ef594a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controller/utils.rs: FileTooLong \u2014 1962 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 61 free functions. The bar is 500 significant lines; this is 1462 over it, 3.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":"src/meta/src/controller/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ec5b3b0e136448102c78cc93a72bcf465af5e9d3358fc8ae3afaefb43360e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionAttr.generate_build_scalar_function: MethodTooLong \u2014 generate_build_scalar_function runs 392 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 292 over it, 3.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/macro/src/gen.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7068c42ae482d5572fb76f8cbdfbb0de06ab6f523cc265f7bff906f2909dd70f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc/ddl_controller.rs: FileTooLong \u2014 1959 significant 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 82% of them inside a single declaration: DdlController (2 blocks, 283-2519). The bar is 500 significant lines; this is 1459 over it, 3.92\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa92b5f942152caac1a312119b29d1b0508ff7c76a27cefc7767a013b7afd9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StorageOpts: TooManyFields \u2014 117 stored fields. The bar is 30 stored fields; this is 87 over it, 3.90\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/opts.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6c0e47149685db32a9ca796ccda9666838c8ba4df4cc88b25dbb568a484fba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::start_iceberg_compactor: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::start_iceberg_compactor runs 384 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 284 over it, 3.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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"042d9138e1a1bebd5cca633444b20a02bfb6a2828d42f8b92171aaffd022e521"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonParseOptions.parse: MethodTooLong \u2014 parse runs 377 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/connector/src/parser/unified/json.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea3799bcf4622259727b6e8d49dc9954b2ba65fa16249e6f840b647f3e1e8d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FragmentGraph.FragmentGraph: FunctionTooLong \u2014 FragmentGraph runs 374 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 274 over it, 3.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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd5db18ffafbd7a49ff47852c46468863c4036897ae320640a4ca622a77da84"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StreamingMetrics: ClassTooLong \u2014 1492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 45-1969. The bar is 400 significant lines; this is 1092 over it, 3.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/monitor/streaming_stats.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8099f8705f71887c1a21906ca9aca2b0e1a9d46440603a8e5718cd2ec7197529"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceBackfillExecutorInner.execute: MethodTooLong \u2014 execute 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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4360cc6b8250fc6acec79f60e6d05f60c355077f6e7b607fa0208cb840cdf48"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DdlServiceImpl: ClassTooLong \u2014 1431 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 3 blocks, lines 69-2006. The bar is 400 significant lines; this is 1031 over it, 3.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c2349e21d0bc2e0b0ce7d11259352a93c390d9425f09153d20802f924b719"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::expr::type_inference::func::infer_type_for_special: FunctionTooLong \u2014 risingwave_frontend::expr::type_inference::func::infer_type_for_special runs 349 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 249 over it, 3.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ca84f73c53b05abb713445eb55e914e853c7c48e165d3033ff56809fbfd674"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: join/hash_join.rs: FileTooLong \u2014 1729 significant 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: HashJoinExecutor (5 blocks, 64-2514). The bar is 500 significant lines; this is 1229 over it, 3.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"495c9871276ab7d280840e915c75fe99ee9136df93c9af487d841979749bc10b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_ctl::start_impl: FunctionTooLong \u2014 risingwave_ctl::start_impl runs 342 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 242 over it, 3.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":"src/ctl/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc33057593b7f53b7f7bc4619c1b776bd6967d9c21792398456048523d117757"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceExecutor.execute_inner: MethodTooLong \u2014 execute_inner 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":"src/stream/src/executor/source/source_executor.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b134f3abd7f420049cbb1efc5d7c62671e007a7d289c2197504a758e13db013"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MetaOpts: TooManyFields \u2014 100 stored fields beside 1 method. The bar is 30 stored fields; this is 70 over it, 3.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":"src/meta/src/manager/env.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e83cf4285cc63182c2741b90016efcfdf2c6b5cc00d88b9fb550a5572f33c0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/state_table.rs: FileTooLong \u2014 1651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1151 over it, 3.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":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09428d97c651190814fcb1289c82ea495ba707c91200509a5fb278ec9719ced"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SchemaCatalog: TooManyMethods \u2014 99 methods. The bar is 30 methods; this is 69 over it, 3.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":"src/frontend/src/catalog/schema_catalog.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c46c8be74466493d8dde7fb6a84169ad9a09e3c72f26f18aaf1f31c8d93dfd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaterializeExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 323 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 223 over it, 3.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mview/materialize.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ad4f4ed244027e3802dbe9943c52983b80663538ff91ba15cfc4876e446f18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: monitor/streaming_stats.rs: FileTooLong \u2014 1605 significant 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 93% of them inside a single declaration: StreamingMetrics (2 blocks, 45-1969). The bar is 500 significant lines; this is 1105 over it, 3.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":"src/stream/src/executor/monitor/streaming_stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"193c7f3f74ad6cbeed83e598df469b9aabc5f110a0e281ac28f7e32e31bf8cee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_compute::server::compute_node_serve: FunctionTooLong \u2014 risingwave_compute::server::compute_node_serve runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.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":"src/compute/src/server.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d56c3f3f22153017d7a9f8612a7f9abd215136494e42543daa8050458b6857"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.update_connection_and_dependent_objects_props: MethodTooLong \u2014 update_connection_and_dependent_objects_props runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":3280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f734f0479ce96b39ecf8dcaebc12865ee22f3e8a1ee82f623638daa007fcff3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrangementBackfillExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 317 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 217 over it, 3.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":"src/stream/src/executor/backfill/arrangement_backfill.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78f5d1bcc9c2db295e7de7d8de020e718c92bc2abc82a3de99a4c3011dd4972"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HashJoinExecutor: ClassTooLong \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), 29 methods, 5 blocks, lines 64-2514. The bar is 400 significant lines; this is 864 over it, 3.16\u00D7 the bar. To reduce it, group the members that share the 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f3acb2987d8955396319c9455d42b3c801f5c16609b9e086d793275445c613"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controller/fragment.rs: FileTooLong \u2014 1579 significant 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 88% of them inside a single declaration: CatalogController (290-2158). The bar is 500 significant lines; this is 1079 over it, 3.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":"src/meta/src/controller/fragment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f3005ad70bc717b2469dbf9eba05f858e19880df5288b446a9ed3e0a2e8266"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/create_table.rs: FileTooLong \u2014 1568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1068 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":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d6754ef537aebaf60d0e97c16e0db3457628d3bc0924a02340278ea40b646"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ddl_service.rs: FileTooLong \u2014 1557 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: DdlServiceImpl (3 blocks, 69-2006). The bar is 500 significant lines; this is 1057 over it, 3.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b78e70ab98cb5688c5a84231b86976495c0e28112aea30a46fc9b06a067f71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risedev::bin::risedev-dev::task_main: FunctionTooLong \u2014 risedev::bin::risedev-dev::task_main runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ea103cc518260d1fbe833fab00782f7bcf0aebb4829084f9dff58c7d941115"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MetaMetrics: TooManyFields \u2014 93 stored fields beside 1 method. The bar is 30 stored fields; this is 63 over it, 3.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":"src/meta/src/rpc/metrics.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c800448e1ee11df163570dd25a5e3a8ea0d39ecd1d0a132e8059077740932d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImpureAnalyzer.visit_function_call: MethodTooLong \u2014 visit_function_call runs 304 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 204 over it, 3.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":"src/frontend/src/expr/pure.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb36b20c0f7fbab39f3a809bbbc7d93862af0f94760ecc3085817dfebd46c5ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_sink::gen_sink_plan: FunctionTooLong \u2014 risingwave_frontend::handler::create_sink::gen_sink_plan runs 297 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 197 over it, 2.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":"src/frontend/src/handler/create_sink.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"658db6d795948e9b7ab9ea80d42da2e5f1900366a80afa6280fc424a9a9d4ac1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Strong.is_null_function_call: MethodTooLong \u2014 is_null_function_call runs 297 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 197 over it, 2.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":"src/frontend/src/optimizer/plan_expr_visitor/strong.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"60341883497ad947e044154a865b6b72f57fd861dabaf97270cd4a98bd4c542c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalBarrierWorker.recovery_inner: MethodTooLong \u2014 recovery_inner runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.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":"src/meta/src/barrier/worker.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b903d9804f7bb9806f0bc3dfc810038127658771df60f4917a6415070802f7e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Catalog: TooManyMethods \u2014 86 methods. The bar is 30 methods; this is 56 over it, 2.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/root_catalog.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b161a654c58b05fc0257387f71f6c479c66fb5fbd1ebba359bede8f08b15135"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream_graph/fragment.rs: FileTooLong \u2014 1429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 929 over it, 2.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1bdee0c6934300fe6d37affede88c9a3c8c14f20d2e0defff98b7771a1452d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/mod.rs: FileTooLong \u2014 1426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 926 over it, 2.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":"src/frontend/src/handler/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57905876aa352dfa26b7f0bbeacbbafb96360589beab0b32763136a75fbb073f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SessionConfig: TooManyFields \u2014 85 stored fields beside 3 methods. The bar is 30 stored fields; this is 55 over it, 2.83\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":"src/common/src/session_config/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e42a6c154432700b143b76b0c3bd07d3f85274666f75729e215e21672059ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalQueryExecution.convert_plan_node: MethodTooLong \u2014 convert_plan_node runs 283 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bee15ba9c26d065dd33f180187d01406df5678113b13166e9cae1e083868ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SnapshotBackfillExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 283 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/snapshot_backfill/executor.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9ad63ded83d2a717a0164e480940101ce3f2cd98ffc1642a0b9ea5ec2db161"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalJoin: ClassTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 11 blocks, lines 58-1874. The bar is 400 significant lines; this is 720 over it, 2.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":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b91fc8b4decfcab1debedae8a69f2d27a6d8b3524188d957a61c04473b09c9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.create_job_catalog: MethodTooLong \u2014 create_job_catalog 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39e9a1ea7978b1f495d093c0f1c1603eba19547f9bd75fe17bb5e19116f5c2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risedev::risedev_env::generate_risedev_env: FunctionTooLong \u2014 risedev::risedev_env::generate_risedev_env runs 272 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/risedev_env.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffad43e8c461604933be51c7336fb53225316855f6cd015219e370258730249"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::show::handle_show_object: FunctionTooLong \u2014 risingwave_frontend::handler::show::handle_show_object 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":"src/frontend/src/handler/show.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed7d30437c69d3adf0ec08d96eccc5ea05a723a133f59f9d785167b8a79ef69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 1350 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 850 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"643bd2d820d76a2c200e5c2b5961222ddbd46ce2e81bbb80d67fb9b63594cac9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.alter_owner: MethodTooLong \u2014 alter_owner runs 270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 170 over it, 2.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b6ab90582cfa51e9eb295fdf96462fdeaedefec8561cc6ba78c6b33e582aab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalBarrierWorker.run_inner: MethodTooLong \u2014 run_inner runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/worker.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12819f88a50e9b297c8847c68957bb6873f1b19822de0b8f2f25de0eb7a3343"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: risingwave_common::config::default::developer: TooManyFunctions \u2014 80 free functions. The bar is 30 free functions; this is 50 over it, 2.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4da9f40bb066b9c3340ca1dd99b9cea0231b25ce3bf97ac989d89a269db334"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RelationGraph.RelationGraph: FunctionTooLong \u2014 RelationGraph runs 266 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 166 over it, 2.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/components/RelationGraph.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"489a8ffc3909ac7f85895ac75707f4f8b32ff85bb30ed51f1db323dbc06d9c76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergCommon.build_jni_catalog_configs: MethodTooLong \u2014 build_jni_catalog_configs runs 263 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 163 over it, 2.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":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdb22f93377d402b61c67e5df0c8b0d95746a1dbfb79c71dc226e61c984431f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::explain::do_handle_explain: FunctionTooLong \u2014 risingwave_frontend::handler::explain::do_handle_explain 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":"src/frontend/src/handler/explain.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"456b78605a5c26d292c756b852fe33a7ed85963254b8cc3cadefe127e258125a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/state.rs: FileTooLong \u2014 1305 significant 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 82% of them inside a single declaration: DatabaseCheckpointControl (381-1849). The bar is 500 significant lines; this is 805 over it, 2.61\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4178c1bf7dde550447e197c0abcb5560096ec0ce351ef2214ff6293518750fa6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.truncate_time_travel_metadata: MethodTooLong \u2014 truncate_time_travel_metadata runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e00568b29594dbc59e6150dfa1a9ef14c87faa57d55e6647f4453cca6543e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compaction/mod.rs: FileTooLong \u2014 1297 significant 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 67% of them inside a single declaration: HummockManager (4 blocks, 207-1452). The bar is 500 significant lines; this is 797 over it, 2.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":"src/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"137d01f985db0cd2359dcbc5b1935ef1ee3b07022e1d7faea2acfca5588d1ba4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.fmt: MethodTooLong \u2014 fmt runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.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":"src/sqlparser/src/ast/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79374cdbd0b23b42ae507adecca1082ea8fcc845c901c5ae1fdcd3a712b18d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_index::gen_create_index_plan: FunctionTooLong \u2014 risingwave_frontend::handler::create_index::gen_create_index_plan runs 253 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_index.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4606563f511cd00fcb2013532efccebd9b8873da5ff201bfeb4b6d569dc39a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc/metrics.rs: FileTooLong \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). The bar is 500 significant lines; this is 756 over it, 2.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba2ebbff1840562db7e5e50d7244235dd09e290abeedb2e3f7f72a0f317c364"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgresConnectorConfig: ClassTooLong \u2014 1001 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 601 over it, 2.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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresConnectorConfig.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdac90b41e932e5d7572b26d1de9c777bc576015910e343c4fc836cdedb3546"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_table::create_iceberg_engine_table: FunctionTooLong \u2014 risingwave_frontend::handler::create_table::create_iceberg_engine_table runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.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":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6933690f23f40af2a211c90c7335a040935c92867193e80f9d08120827f117"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.merge_compaction_group_impl: MethodTooLong \u2014 merge_compaction_group_impl runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.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":"src/meta/src/hummock/manager/compaction/compaction_group_schedule/topology.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f2ccaaa41374964201354a34c1bf224e2d3d535a0bdf526cac4abe92a45c6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_common_proc_macro::session_config::derive_config: FunctionTooLong \u2014 risingwave_common_proc_macro::session_config::derive_config runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.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":"src/common/proc_macro/src/session_config.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca0f321e84a5da7e536d8f951a7dc86ee33b6e46de25286b78378adc1b91297"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrow/arrow_impl.rs: FileTooLong \u2014 1225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 725 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":"src/common/src/array/arrow/arrow_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75607035c50a6d2496f5e5b05e30c4c71cb0887a6c35a2dc0115c588e3f43bab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostCollectCommand.post_collect: MethodTooLong \u2014 post_collect 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":"src/meta/src/barrier/context/context_impl.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7523f341184e0680548439ebb8f88979c871b4ba3d29996408a661fb17e30713"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::start_compactor: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::start_compactor 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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2a4883a5055363017e331b9d433ab46ed0c9f311f46daab3070a7ba8b9a1ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: uploader/mod.rs: FileTooLong \u2014 1219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 719 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":"src/storage/src/hummock/event_handler/uploader/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"550e5fef5d5af1912766d9ca3f3dc1150e01a5632c58f98a8ad9f27348f5b428"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/logical_join.rs: FileTooLong \u2014 1216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: LogicalJoin (11 blocks, 58-1874). The bar is 500 significant lines; this is 716 over it, 2.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":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a097315850f2d3de5d9d9c57711842766b990a80122769dd4ec495acff7875f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.get_compact_tasks_impl: MethodTooLong \u2014 get_compact_tasks_impl runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7069a2f0c9d4c48d1758bd93e43cea7ff923613aac7b31c51b39da011c1dd967"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compactor/mod.rs: FileTooLong \u2014 1212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 712 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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dec4fe7247fcf54a6c463c608d8d126b44a4c68796caafff16d46eea54586a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalityProviderExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/stream/src/executor/locality_provider.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd168f67de39598fc6dc4965526c2c9775c155d3fec6a5aedf6d550f932fb16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlServerStreamingChangeEventSource.executeIteration: MethodTooLong \u2014 executeIteration runs 240 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 140 over it, 2.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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/sqlserver/SqlServerStreamingChangeEventSource.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1e91c95b24c71617873af3ba2fa46ffdad7127547228a55c8cf23ea1ae6040"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MetaConfig: TooManyFields \u2014 71 stored fields. The bar is 30 stored fields; this is 41 over it, 2.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/meta.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8ae4785781580ead7776f6a55eda6718851abfe71926feb443a71ee622fb61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controller/scale.rs: FileTooLong \u2014 1183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 683 over it, 2.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":"src/meta/src/controller/scale.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9a90746222e80f174fd81f83fba51dfe2490e358d23a402cd8a5250ee80381"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlController.replace_job: MethodTooLong \u2014 replace_job 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":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5b6a8a7859c89388aaca8e254fbf20137e6fd6e0b874c851225af92d7c9447"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_rt::logger::init_risingwave_logger: FunctionTooLong \u2014 risingwave_rt::logger::init_risingwave_logger runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/runtime/src/logger.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50274033176b8aeac22f735a3b1a50ec60f9cfe67923f0730412d0c088d535e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.drop_object: MethodTooLong \u2014 drop_object runs 234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/drop_op.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9b9933c4732ac77fba02177083d03783a5376ac538cb6b214e323c06e5b406"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/command.rs: FileTooLong \u2014 1166 significant 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 66% of them inside a single declaration: Command (6 blocks, 463-1790). The bar is 500 significant lines; this is 666 over it, 2.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":"src/meta/src/barrier/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a849dd9794e33c0614fe44509416f60f8679bd863099adb16636e73f9bf35b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Statement: ClassTooLong \u2014 932 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 4 blocks, lines 1276-4033. The bar is 400 significant lines; this is 532 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/ast/mod.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b6617543f0e021c5889b9ca0634b8e77150efe135a9274d696dda41b0dab2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::handle_privilege::make_prost_privilege: FunctionTooLong \u2014 risingwave_frontend::handler::handle_privilege::make_prost_privilege 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":"src/frontend/src/handler/handle_privilege.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c59af844d85d6e4921ddf0443228d9445f2deb1392a1d7700991c9f0d3e9e75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fragment_graph.Streaming: FunctionTooLong \u2014 Streaming runs 232 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 132 over it, 2.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":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5007c785d85735f6cda9336a1dba510809f014961641ff98e2d45423ed154fd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.commit_epoch: MethodTooLong \u2014 commit_epoch runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.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":"src/meta/src/hummock/manager/commit_epoch.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6bc55eb7e4585c0eabf15cdcdc538b58b9dea3254e96242c0d0284fd82203f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: relation/match_recognize.rs: FileTooLong \u2014 1150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 650 over it, 2.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a72f5d263530584adb9a63c8584c162ac6cc08b320a6eadfb4693f4bbb901b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/m20230908_072257_init.rs: FileTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: Migration (11-1050). The bar is 500 significant lines; this is 618 over it, 2.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/model/migration/src/m20230908_072257_init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ef2333ce8927b8a0579a028975be43a224a86a355882bfcac4746397987a78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StorageConfig: TooManyFields \u2014 67 stored fields. The bar is 30 stored fields; this is 37 over it, 2.23\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":"src/common/src/config/storage.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"90602049873a5aa5cca98b5fa07b1d6fd08ed6448830a9548a8853c2b4363113"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/mod.rs: FileTooLong \u2014 1115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 615 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":"src/stream/src/executor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f004be629c9c57b888353074cbc6a3bb81ffeae130ad0e8d1064976b39dbe362"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Migration: ClassTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 486 over it, 2.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":"src/meta/model/migration/src/m20230908_072257_init.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"98922fea9d8709f0ca129f16c05bc82c5b5e38f03c23e1a7944228ab626b4fce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DiagnoseCommand: ClassTooLong \u2014 883 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 53-1199. The bar is 400 significant lines; this is 483 over it, 2.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/diagnose.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"994e8b44fa228f6ceac71b3eb9a7798ac953f8d27b479011cb0a8dab012c14fa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HashJoinExecutor: ClassTooLong \u2014 883 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 4 blocks, lines 158-1404. The bar is 400 significant lines; this is 483 over it, 2.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"93241c5fea0c1d9f8e5906dcb7b477517673d0dc327787fcf2ec54273a7ebd74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_match_recognize: MethodTooLong \u2014 bind_match_recognize 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"119dbf03fa1d95d6eb5a36081cae69fa880c73e122b064dd3dd5ec6c5aa7e9f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compaction_group/hummock_version_ext.rs: FileTooLong \u2014 1095 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 595 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafcb24977915bf4234a79f4ba3423f79946607ee56ebf355c4fbef229b6c623"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/rpc.rs: FileTooLong \u2014 1091 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 591 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/rpc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a24320cfd795b5deceae220fd6e3f107844e0d61ef8d3f6c0edfe018c042296"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashJoinExecutor.new_with_cache_size: MethodTooLong \u2014 new_with_cache_size runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cc12bb5c77f935ff422089a4fbb677d9fc0022acb0fd06930daed070407ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FsFetchExecutor.into_stream: MethodTooLong \u2014 into_stream runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b1c3a131a3fd13b7d6b8b470b7a121bc7741d2ebedd2b9741c7982e9ec6f82"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobalBarrierWorker: ClassTooLong \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), 16 methods, 9 blocks, lines 86-1526. The bar is 400 significant lines; this is 463 over it, 2.16\u00D7 the bar. To reduce it, group the members that share the 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/meta/src/barrier/worker.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8a4dfbd6417772a96b33a4c8b73cd3940b18f727ff0ac3d357d8b5cc31f58f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Catalog: ClassTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 86 methods, 3 blocks, lines 122-1276. The bar is 400 significant lines; this is 462 over it, 2.16\u00D7 the bar. To reduce it, group the members that share the 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/frontend/src/catalog/root_catalog.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c501ffdd257fd894b9a37627370176e031d6760a660701e24700e48d95e5e20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FrontendEnv.init: MethodTooLong \u2014 init 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":"src/frontend/src/session.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcb2a7efafc04475b1a3c0be06c89550470d8cc07f837ece3dede173496eb39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pg_protocol.rs: FileTooLong \u2014 1064 significant 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: PgProtocol (3 blocks, 72-1308). The bar is 500 significant lines; this is 564 over it, 2.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4cf27d52b6b0fd905b7cd677f90be42a5a8c3c50c03be48e0c25974fe431e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store_impl.rs: FileTooLong \u2014 1063 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 563 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/store_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7800af44b41fef748ab70b3ac82f2a7714cde32798dcadf7580654db0aa5e1a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: batch_table/mod.rs: FileTooLong \u2014 1057 significant 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 67% of them inside a single declaration: BatchTableInner (6 blocks, 265-1351). The bar is 500 significant lines; this is 557 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/table/batch_table/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4c6655292e37199c0f7fc0d904c25cb5ac7c58a388ee61635b3db3615b2de7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::compactor_runner::compact_with_agent: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::compactor_runner::compact_with_agent runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compactor_runner.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e8c3cc0db8fe252cb84d6012db67d56e5988f1c6248140d6c2c48d19c85605"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionImpl: TooManyMethods \u2014 63 methods, declared across 3 files: src/session.rs (48), session/transaction.rs (11), handler/privilege.rs (4). 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":"src/frontend/src/session.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"850b9424f5635ce52eea1b15308f5515b1f6b471b300ea22bf40ca2ada65a714"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::iceberg_compaction::memory::estimate_plan_memory: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::iceberg_compaction::memory::estimate_plan_memory runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/iceberg_compaction/memory.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a5e80943caab5f75ed04931cd32d58fbfc5987af98b914fd500a5472f792d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/mod.rs: FileTooLong \u2014 1048 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 548 over it, 2.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b279a05459ea2e6259a2ae4b769dc9f8a460f2b626b5911b474e4d28419d9bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kafka/stats.rs: FileTooLong \u2014 1040 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 540 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/kafka/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18720f92dcba94ed5c5d9d6bbce7534176949a4307ac1d40a2f22bb7d75235c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/logical_agg.rs: FileTooLong \u2014 1040 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 540 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ac0e6b45819e06a9f7ce730b8258b6cb7ad74aebaf6abf9d355a90ea2d6309"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gen.rs: FileTooLong \u2014 1034 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: FunctionAttr (23-1448). The bar is 500 significant lines; this is 534 over it, 2.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":"src/expr/macro/src/gen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e41a50a61b553f90716ab0cfb8acdd9216caedbd7e06f09e76c8db6c8d1281"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postgresql/PostgresConnectorConfig.java: FileTooLong \u2014 1033 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: PostgresConnectorConfig (62-1637). The bar is 500 significant lines; this is 533 over it, 2.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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresConnectorConfig.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1900fb42627cbeea0004fbe9f879ef4c66a87f1fb495b7f956e60151c7175178"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/create_source.rs: FileTooLong \u2014 1032 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 532 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb0bd3498f316305a26d432de81406cbf746d2adeda6f00575b8d712b614065"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashJoinExecutor.do_execute: MethodTooLong \u2014 do_execute runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84b4c7650163c359ea59316d16e2d1998fdb99e70a7541d309353d74ee5280f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/mod.rs: FileTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 528 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eded3b0e42fee25b654a4725786cf86462cb90c913cc5f095bdf6116d1215f98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/mod.rs: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 526 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d2b2029cff06ca00a6987386a90e6a8540f467719af0967a98b09eba606b56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: batch_refresh_job/mod.rs: FileTooLong \u2014 1019 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: BatchRefreshJobCheckpointControl (8 blocks, 197-1464). 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":"src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9ec0e92481316683efc0a4ee91f58feb5e1529052d5061a49f29a87aebbbac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BatchRefreshJobCheckpointControl: ClassTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 8 blocks, lines 197-1464. The bar is 400 significant lines; this is 414 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":"src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d18e83dc4e7a128675482ebba78dc552f9a4a65e80ca4f3d43fda6bd2568fa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/worker.rs: FileTooLong \u2014 1017 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: GlobalBarrierWorker (9 blocks, 86-1526). The bar is 500 significant lines; this is 517 over it, 2.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":"src/meta/src/barrier/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee68b2b8549631a760eac8d3901027759ce088d5d3eac8b0aecacd6a581b9cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_compute::memory::config::storage_memory_config: FunctionTooLong \u2014 risingwave_compute::memory::config::storage_memory_config 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":"src/compute/src/memory/config.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9565b35cf78cc0080713c6dbacad72ccec85bc84b31f647c12b385e4e739ee67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.lower_measure: MethodTooLong \u2014 lower_measure 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"161002c9d9ea64c61f97c67275a89460580eb92f331c0a2421836d6aa4646801"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchRecognizeExecutor.execute_inner: MethodTooLong \u2014 execute_inner 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":"src/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"384719dcce522c6b0e77a0c45a29165c18bf9895cfd2acc0725e6421a5b33637"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier_worker/managed_state.rs: FileTooLong \u2014 1001 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 501 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/task/barrier_worker/managed_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c790076cbd0d6ec22d5a57a289f736d7e99f77095bd56e7d1827236e2440bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionAttr.generate_build_table_function: MethodTooLong \u2014 generate_build_table_function runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/macro/src/gen.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c74c94fc07f7bc800f96bebbc5d2e57bb6c15f20b6aabb22c4c05359731d9c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlServiceImpl.auto_schema_change: MethodTooLong \u2014 auto_schema_change 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":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"807d80ca391979586bf3ec679ed9aa037fcc7d7dec03d528bb1ecc80e5af6104"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionAttr.generate_agg_build_fn: MethodTooLong \u2014 generate_agg_build_fn runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/macro/src/gen.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"046e9a0ce74984db8ab754d9b5823047075185e2cecc6aff001ee4644dc38980"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TestCase.apply_query: MethodTooLong \u2014 apply_query runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d2a8679439a5db2e195fd56cc5d5c024707d189f05066392ebb4092b4495f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GapFillExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff45ada9e5575201fea88930bad0b73b67aa400812438291dc153a89af25ccde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: risingwave_common::config::meta::default::meta: TooManyFunctions \u2014 59 free functions. The bar is 30 free functions; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/meta.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd958cf388eff0cadcb51f5a54ffc334ca449f750925fc3fff5341f77cfda01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/info.rs: FileTooLong \u2014 982 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: InflightDatabaseInfo (3 blocks, 459-1453). The bar is 500 significant lines; this is 482 over it, 1.96\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d2f186ae7cc76df133972258f6d57cc8e98005d448389e794f65b46b75fc2f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SchemaCatalog: ClassTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 99 methods, 4 blocks, lines 46-1159. The bar is 400 significant lines; this is 385 over it, 1.96\u00D7 the bar. To reduce it, group the members that share the 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/frontend/src/catalog/schema_catalog.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"403e2ef3f482b40fde7aad438486e2714fd564d14e0e089904fe92c82eab51d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/hash_join.rs: FileTooLong \u2014 979 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: HashJoinExecutor (4 blocks, 158-1404). The bar is 500 significant lines; this is 479 over it, 1.96\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f623ebc11bfc9745eb5957cc441bc1755accd0580dc77c54a999af401285e06f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StreamServiceImpl: ClassTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 3 blocks, lines 61-1121. The bar is 400 significant lines; this is 380 over it, 1.95\u00D7 the bar. To reduce it, group the members that share the 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/meta/service/src/stream_service.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0722acaf1fefd0b2033bfe535db2b918d648e248f70cae3d5eee29645ff190"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkpoint/control.rs: FileTooLong \u2014 975 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 475 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90372f86d604c0cd41c09bdec52005ef49290e7938f52235d6235fcf3a0d9d5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: heap_profiling.HeapProfiling: FunctionTooLong \u2014 HeapProfiling 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":"dashboard/pages/heap_profiling.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f16f0c38605793e1268f2f74432400ec041bdeb73eaff6ceef6afa7411c6bcb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CreatingStreamingJobControl: ClassTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 85-1104. The bar is 400 significant lines; this is 378 over it, 1.95\u00D7 the bar. To reduce it, group the members that share the 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/meta/src/barrier/checkpoint/independent_job/creating_job/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"de716462956d72f3c7c90fb90a96b81532cb4fc001d636ec260ad9bf57c55f88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scheduler/plan_fragmenter.rs: FileTooLong \u2014 971 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 471 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/plan_fragmenter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e8f974a6e421601d8a9e5dda7c1e8a4db8a8886c885370d85c0e9671f206e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StageRunner.schedule_tasks: MethodTooLong \u2014 schedule_tasks runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b26d06d3a98a4654a555c0b3c378f74f97c59011d3c4ed9da01f409e8cc67fa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StreamingDeveloperConfig: TooManyFields \u2014 58 stored fields beside 1 method. The bar is 30 stored fields; this is 28 over it, 1.93\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":"src/common/src/config/streaming.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb1c237aad4a422238b27a670097804489a838c4cf8d22b527779d274f74fb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manager/diagnose.rs: FileTooLong \u2014 966 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: DiagnoseCommand (2 blocks, 53-1199). The bar is 500 significant lines; this is 466 over it, 1.93\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/diagnose.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bcbb5bcc2ba13623d4613148ccffead9c3f285bcd94e159ae79990c326bdf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_source::external_schema::bind_columns_from_source_for_non_cdc: FunctionTooLong \u2014 risingwave_frontend::handler::create_source::external_schema::bind_columns_from_source_for_non_cdc 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":"src/frontend/src/handler/create_source/external_schema.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eb23c98d9fdee16458ec21dbe52338b37fc8140989c363111136c2963a2cf3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CreatingStreamingJobControl.new: MethodTooLong \u2014 new runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/creating_job/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e4ede0218cbbcc929d0a1ac3bfd2c1a6c08fd99b1e4ae13f29591c4653e85e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Command: ClassTooLong \u2014 765 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 6 blocks, lines 463-1790. The bar is 400 significant lines; this is 365 over it, 1.91\u00D7 the bar. To reduce it, group the members that share the 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/meta/src/barrier/command.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c7853be581caf6911741c0c402967d48fa8fb27b87cf5c3cbfdce9294ffdaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/sync_kv_log_store.rs: FileTooLong \u2014 952 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 452 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/sync_kv_log_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1612812633e3074cc9c39098e1b0e7c8d01ffbc3c42f523fb098cd8e77d185"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_insert: MethodTooLong \u2014 bind_insert runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/insert.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dbe5225139a88a61064356bd34c41de1b6e978a963a5b1c7e0aee6835fcf00"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_source::bind_create_source_or_table_with_connector: FunctionTooLong \u2014 risingwave_frontend::handler::create_source::bind_create_source_or_table_with_connector 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":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dd2f5d7834b65637a1fddab1c6faab6c104f66c9c935434e5f2989f346823f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnoseCommand.write_table_definition: MethodTooLong \u2014 write_table_definition 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":"src/meta/src/manager/diagnose.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba43fc9655de119cfac1b73c3677cbfd7ee32ab6fdc69d4fc98bf484e8fbe4c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/memory.rs: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 438 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d520e64b9d11bf67220c4b8d6cf8f71fa682d83424da2592762b3f8f833aaace"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Condition: ClassTooLong \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), 30 methods, 4 blocks, lines 40-1222. The bar is 400 significant lines; this is 348 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/condition.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"95396509c0aa9a28f74287aebf026a626f4cb879b636ef965b4834353de03829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/version.rs: FileTooLong \u2014 935 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: HummockVersionReader (3 blocks, 587-1359). The bar is 500 significant lines; this is 435 over it, 1.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"671ec9452033fe03c834c6aeab207889e737c9ce0800a07d0b6a0c57030a7275"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompleteStreamFragmentGraph.build_helper: MethodTooLong \u2014 build_helper runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dba181a55b0142536497ca444a78db14c129965cc7fb2b826f85a75a0c43cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactorMetrics.new: MethodTooLong \u2014 new runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/monitor/compactor_metrics.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1fd04a681efb6645aeb1ff9d759de919b29ba819c4807cc0308e233757549f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MetadataManager: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/metadata.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f23327104ae3d872495f95f5ca1251bf880e64258a9eb88ac46c9908117d0a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/scale.rs: FileTooLong \u2014 933 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 433 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/scale.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cb6f1e5204358cfe0ae398571e572f6464de8f4086890b73819e9f40a58537"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/root_catalog.rs: FileTooLong \u2014 932 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Catalog (3 blocks, 122-1276). The bar is 500 significant lines; this is 432 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":"src/frontend/src/catalog/root_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"474690cc0ae9cc28056fb4a9b55558a18b23e0126e9fbc28d0a4cc06c4ae4cb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 930 significant lines (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 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jni_core/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1e8d75df373b87824797cc70cc3deb6ad54c98bcd89d108899081cdcddad9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WaitCheckpointTask.run_with_on_commit_success: MethodTooLong \u2014 run_with_on_commit_success runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"226f509c4b91823ddce7efbaf8883ebef7f58b1fef4201855a61a7c1cd69ce78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BeMessage.write: MethodTooLong \u2014 write runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_message.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c538b385d37a282b9b8a041ee87c51825bb24adab5eb8610c8ef14008a20f898"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/cursor_manager.rs: FileTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 428 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/session/cursor_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc2d6ed4c6854532828f84e8e4c016e3f247f0ca2e3c7336d3a4ab996fe929e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetaMetrics: ClassTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 3 blocks, lines 73-1110. The bar is 400 significant lines; this is 341 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":"src/meta/src/rpc/metrics.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"305931816df30fb3d474213a7aca25d96640564af0b9f03d6b0130507dbbfe8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartitionStats.new: MethodTooLong \u2014 new 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":"src/connector/src/source/kafka/stats.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec03c439791e135ee2a5682781b2ecc093d83301dc03e43cfd35526f68d3fcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snowflake_redshift/snowflake.rs: FileTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 420 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/snowflake_redshift/snowflake.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b5c82c6f9e464aec4ff73419716e2b503b3d9d632990e14d96787549268300"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::parser::unified::debezium::parse_schema_change: FunctionTooLong \u2014 risingwave_connector::parser::unified::debezium::parse_schema_change 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af2e7950185db2f1dbf5a86c20109d8ffd3912e8b3c6581e33d1f9041cfa383"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprImpl: 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":"src/frontend/src/expr/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"600790fce137a07082a9b3e8271c4ca2d39345c781e116d863328ee6ec66db52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/source/trad_source.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ab25e2ad5e1ef86ed3b29fac27c01b997af6f924c0f69f469567798099d375"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::alter_compaction_group::build_compaction_config_from_params: FunctionTooLong \u2014 risingwave_frontend::handler::alter_compaction_group::build_compaction_config_from_params runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_compaction_group.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fffb97b439a8dd2a5ca41b213eecb3c6f964016d34cbde00781e8370cba261a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::stream_fragmenter::build_fragment: FunctionTooLong \u2014 risingwave_frontend::stream_fragmenter::build_fragment runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/stream_fragmenter/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95551c28b8224de3df88b9b3b4934c4d2af687b720a8d2465bd78a4b6349c4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.split_compaction_group_impl: MethodTooLong \u2014 split_compaction_group_impl runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_group_schedule/topology.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89101c1bc35da4ffa28024ac6aaf733df840fde64e9bf7c51052727e56c34f3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PgProtocol: ClassTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 3 blocks, lines 72-1308. The bar is 400 significant lines; this is 320 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee78eb39352fb972d8897e241cdd1660c6de94b3fc625608e6e58185e2573aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbzConnectorConfig.\u003Cinit\u003E: MethodTooLong \u2014 \u003Cinit\u003E runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb893f5bc9d7902a4a6b1287f1678c8db5c7f531275100f810f42ac06cbe4494"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashAggExecutor.do_execute: MethodTooLong \u2014 do_execute runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"7934ff3b033ca851dbc6b4abb7e363b894aa6cab6ee4216de1fe53c7ec9be15d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/mod.rs: FileTooLong \u2014 895 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 395 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":"src/connector/src/sink/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae1538c84bfeda40b434deafc6668d0e391045dce4431310af9b99670455f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateStoreImpl.new: MethodTooLong \u2014 new 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":"src/storage/src/store_impl.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabb38c619ea214c31935942c915847cef819394ce17178169139e809496143f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalAggBuilder.general_rewrite_agg_call: MethodTooLong \u2014 general_rewrite_agg_call runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ff4ed582617d90ba97457ea41749feb433764f37b13ab10bd1a7d147261d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connector_common/common.rs: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 387 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a92ed6e4932ea3458a861524c316530e8dff6473419608390a8508e7c98106"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg_compaction/schedule.rs: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 387 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/iceberg_compaction/schedule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e768b352f50885fc50b7e13093ee251f4f40c2c54afd7e4d95704e6735770f9f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BatchTableInner: ClassTooLong \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), 31 methods, 6 blocks, lines 265-1351. The bar is 400 significant lines; this is 309 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":"src/storage/src/table/batch_table/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aecbcdb7c19f3bc5f7c44e788988ff5bd732c41750d6f367451745eab6c6ccb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TestCase.run_sql: MethodTooLong \u2014 run_sql runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cb9979052f598d79270f5c06f03bad1a1e69f1f8e26253768abf1fd2af9ca0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_source::handle_create_cdc_table_source: FunctionTooLong \u2014 risingwave_frontend::handler::create_source::handle_create_cdc_table_source runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9cfb26c27a931c42c86b78b60d40b609fbf8df16859bfe3c7533db852b5a0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/alter_op.rs: FileTooLong \u2014 874 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: CatalogController (34-1136). The bar is 500 significant lines; this is 374 over it, 1.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":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8eb7995fa448986ccb6ef630618f6cf8a37f133e3f57d1e4f6151e9a6d7dd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg_pk_index_sink/coordinator.rs: FileTooLong \u2014 871 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 371 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/iceberg_pk_index_sink/coordinator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c575f46e04903f8aca3c9095e88084c01835bf9fa82ddc3dd675b6e0925df0a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/show.rs: FileTooLong \u2014 869 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 369 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/show.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b6365819820c0ac36fc8addb7c7baa54782b1374656711aeb43d9ee04d2dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unified/debezium.rs: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 368 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acd437d5979df7ed851151cbb8f6d49442ce84dc4a6a098afe9968dd8eef4fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/mod.rs: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 365 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/object_store/src/object/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"616a2052c929a1edfd83a41a623bbf0cb6ecbcb2f3fdf3a5975129c06868f3ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/mod.rs: FileTooLong \u2014 864 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 364 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/types/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5b16f514baff04c508bf19a9f25783d14b7c3555108db67f37920b3816ed18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/clickhouse.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":"src/connector/src/sink/clickhouse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbf0ca176b076bf0b19730c04527feb7c8e8a1ce851eeeb3777ca88eaadc6f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergSinkWriterInner.build_upsert: MethodTooLong \u2014 build_upsert 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":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2844858139af839dd046ad892a0a666baef871340b5d24ddaf448c0761fb05f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrokerStats.new: MethodTooLong \u2014 new 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":"src/connector/src/source/kafka/stats.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"19207725fc6ecf67e5da149c0bc0efece9f4ea3974e0910ae4ddd3786a984903"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoordinatorWorker.run_coordination: MethodTooLong \u2014 run_coordination 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":"src/meta/src/manager/sink_coordination/coordinator_worker.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49bbc1147ac94900f437f44effc0e9765097ed0f30bd548917bcdade67dcba1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StorageOpts.from: MethodTooLong \u2014 from 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":"src/storage/src/opts.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"640bccaff4d355b82d616ae3e492053d800fc509eb8f4b0d2195e490927b5cf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: match_recognize/executor.rs: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 358 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2ee0de093a307cdaaea907f320e5967c65aed01300493f0557e748101420d8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MaterializeExecutor: ClassTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 5 blocks, lines 68-1212. The bar is 400 significant lines; this is 284 over it, 1.71\u00D7 the bar. To reduce it, group the members that share the 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/stream/src/executor/mview/materialize.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0647ff507c6be33e0d4c335a72c4f6d8f736c256c67988ef9e8e4b5baaba78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_source::bind_all_columns: FunctionTooLong \u2014 risingwave_frontend::handler::create_source::bind_all_columns 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":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"85859ff23fac689a1cc5e0e8f01cdfe668f77b18f231c94f3c8b40f33e6b38b6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SourceExecutor: ClassTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 4 blocks, lines 98-1173. The bar is 400 significant lines; this is 283 over it, 1.71\u00D7 the bar. To reduce it, group the members that share the 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/stream/src/executor/source/source_executor.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c92db4d4486c557ebe8aba280aae010506e86f791f2510fe88ce03690df543"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DdlController: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a83738b1f6a449bd45b33c33a5872ec375371187577954d6e7f1f857279be7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AvroParseOptionsInner.convert_to_datum: MethodTooLong \u2014 convert_to_datum 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":"src/connector/codec/src/decoder/avro/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"624743f8396644ab86bd22ddaba5ba4803e9d9ed52df51c8725f62a3d258c1b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WatermarkFilterExecutorInner.execute_inner: MethodTooLong \u2014 execute_inner 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":"src/stream/src/executor/watermark_filter.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"938c5567b61a0f0bfdd2598ba9509349f09017719e3cc69514e88d35592855ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stream_service.rs: FileTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: StreamServiceImpl (3 blocks, 61-1121). The bar is 500 significant lines; this is 349 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/stream_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb3c0dab4c4d5c9a8638faaa21cf2e0fbc81d1ae158ef4cdff3b8cb8d3b8c25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/condition.rs: FileTooLong \u2014 847 significant 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 88% of them inside a single declaration: Condition (4 blocks, 40-1222). The bar is 500 significant lines; this is 347 over it, 1.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/utils/condition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc3f19ffd64360455f4d016ddf7a8349ceb3a1ac7f5041f0e641f41c248aa0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/create_sink.rs: FileTooLong \u2014 845 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"src/frontend/src/handler/create_sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"782a9402be95ac058daedb6ec1c8422e16e2801b872eb20d6be0d0717355b7d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsOfJoinExecutor.eq_join_right: MethodTooLong \u2014 eq_join_right 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":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8e2371bf9b6fc714cd5aca68872c74384f2de7619c4447a0d338956bbbf03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/statement.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). 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":"src/sqlparser/src/ast/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76bcf612eed2deaf5b92fc1a74da449356adc8a9996f05cba8c8771db5b082b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/storage.rs: FileTooLong \u2014 837 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 72 free functions. The bar is 500 significant lines; this is 337 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"272f94c80bad2d97d7ef059647d746ab575b30721d173e8892b5805aa79fa50c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/source_executor.rs: FileTooLong \u2014 837 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: SourceExecutor (4 blocks, 98-1173). The bar is 500 significant lines; this is 337 over it, 1.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/source_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56313d4cb0d2ace9b7f91368012d105957a1fb3438d3228aa69b01438ec037e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: creating_job/mod.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), about 93% of them inside a single declaration: CreatingStreamingJobControl (3 blocks, 85-1104). The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/creating_job/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc36befc7ed395f6817bbbf45c257c49f914d439b96fa41bb30eb97ddf72a0f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::controller::catalog::util::load_object_models: FunctionTooLong \u2014 risingwave_meta::controller::catalog::util::load_object_models runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/util.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"411fda4439b4a141b9aa8c3a842f2d97bd96a574db3f86558b60cdc23844be08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClusterControllerInner.add_worker: MethodTooLong \u2014 add_worker runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/cluster.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4124f0ce936eb20ad042a63b833e384dcf08081fa7ceb1d62be90c3a0d80192"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergFetchExecutor.into_stream: MethodTooLong \u2014 into_stream runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/iceberg_fetch_executor.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1ffc28fcdb54806965d952760552a0865e4ba9381accae0687277f7c27d724"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemporalJoinExecutor.into_stream: MethodTooLong \u2014 into_stream runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"658153e273524112cdccb8c9d56b21a8d2d80e310596c05ab492a2aec1a96877"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverWindowExecutor.apply_chunk: MethodTooLong \u2014 apply_chunk 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":"src/stream/src/executor/over_window/general.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1eefbbabbd5bb4558ff7733e0a61cbad96a6c385ec63b08469d24ff2ea073f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::alter_owner::handle_alter_owner: FunctionTooLong \u2014 risingwave_frontend::handler::alter_owner::handle_alter_owner 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":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"499ca4a029eadb161497d775d41c5c2412c6bf7973e692971cf992d2e1bd1374"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::describe::handle_describe: FunctionTooLong \u2014 risingwave_frontend::handler::describe::handle_describe 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":"src/frontend/src/handler/describe.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9b2e810e98a109ea8cb381d9e6981d497b075cc19e0dd948daa1e1769e49eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgresValidator.validatePublicationConfig: MethodTooLong \u2014 validatePublicationConfig 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4a7a3142dbb06173e6e66c1eee40b883493a866a9334df139d6ab215bd4088"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.update_source_props_by_source_id: MethodTooLong \u2014 update_source_props_by_source_id 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"50665f462687867751a15d0b3608f7394e6de8d695dba7e357b1e0f2c782575a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TableCatalog: 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":"src/frontend/src/catalog/table_catalog.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2c4b55e7793c4a5ee43f6d0e82ea5df91ba8a3f35d157c6ea1e1c249505fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AsOfJoinExecutor: ClassTooLong \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), 9 methods, 4 blocks, lines 96-1005. The bar is 400 significant lines; this is 253 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":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dab45a7b32ed79ef261128244bf900c9d79194f00c5de75d2c3538e573fefcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/source_backfill_executor.rs: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: SourceBackfillExecutorInner (3 blocks, 90-1255). The bar is 500 significant lines; this is 316 over it, 1.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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da37e33a2f26e9eff631733418d5d9577ae942cae4e0e350548397c30b0adf26"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamChunkDeserializer.buildValueGetter: MethodTooLong \u2014 buildValueGetter 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/deserializer/StreamChunkDeserializer.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"971bb339b85cc5ac27b35aea09cc521a9fca61682acdd71b0111fb399358786d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MonitoredStorageMetrics.new: MethodTooLong \u2014 new 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":"src/storage/src/monitor/monitored_storage_metrics.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d90c6bd66de559198015a5b520a6e89099bd081bed0c9f5ee4bb26dcd06695"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyncLogStoreDispatchExecutor.execute: MethodTooLong \u2014 execute 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":"src/stream/src/executor/dispatch/dispatch_sync_log_store.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91f289db33ad12eae8940583b973a53d61e389b513d1330ccdc12646a01a81e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/schema_catalog.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), about 97% of them inside a single declaration: SchemaCatalog (4 blocks, 46-1159). The bar is 500 significant lines; this is 312 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":"src/frontend/src/catalog/schema_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6807be07c26bf75e031c4695b6fe3881758e3b0c5d066388bf062c0d8869a9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_table::handle_create_table_plan: FunctionTooLong \u2014 risingwave_frontend::handler::create_table::handle_create_table_plan 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":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4efc585feadf8c3d269c9705dc6b3a852eedd760b40804f66ad13455da07ffe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tokenizer.next_token: MethodTooLong \u2014 next_token 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":"src/sqlparser/src/tokenizer.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"98024c3b46b07465c7f2e898921a94800fe647780b131b7f7172824108112f1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot_backfill/executor.rs: FileTooLong \u2014 809 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 309 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/snapshot_backfill/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba7164a5d563eba52d75430ffbd8d4adc4ba1b386b101e0cda6e831338ac435"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/version.rs: FileTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 308 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/version.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05ca685249e1f03118db4750a7e92c284c084cefbe4845f76f82c6f34a9d70e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.post_collect_job_fragments: MethodTooLong \u2014 post_collect_job_fragments 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed82139756215eabaf85a066d396afa1a457921dd1b451e1ba6a87b7191701c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::stream::scale::build_reschedule_commands: FunctionTooLong \u2014 risingwave_meta::stream::scale::build_reschedule_commands 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":"src/meta/src/stream/scale.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"739cef56c084eb8dbfff964c02a60731cab0d5b98155806f4acb1e3637591a5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockVersionReader.get: MethodTooLong \u2014 get 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":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"596174b78f16f99983b742363e709dbfa0cf0369059e7a6ac58792d463a6973c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: risingwave_expr_impl::scalar::arithmetic_op: 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":"src/expr/impl/src/scalar/arithmetic_op.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0690b6c4b974ff5b2afd7d27d676d738db9834042a005b6f6f05c993f5440950"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InflightDatabaseInfo: ClassTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 45 methods, 3 blocks, lines 459-1453. 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":"src/meta/src/barrier/info.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6f87a5fa61140d1e64e77db3354dcf4c75c28617381efd2bbb2ca21dcb9aa3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlServiceImpl.create_iceberg_table: MethodTooLong \u2014 create_iceberg_table runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"7114170ddaec6028d61df8addaae8cdb0530fcf3149274a3a9925f2bfb2e4b2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.create_version_checkpoint: MethodTooLong \u2014 create_version_checkpoint runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/checkpoint.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2910fbec3b6e218e308222ef8e1cb6437daefd862c6909fa344900bf6b940ba0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockVersionCommon.apply_version_delta: MethodTooLong \u2014 apply_version_delta runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f051a31663f303e7fec148b66f3601ca7966a709681c58a51dcba6bda419d987"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SstableBuilder.finish: MethodTooLong \u2014 finish runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable/builder.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edf21486de8c8f0ba8628c0404d82611957cadd0d828a1d10579fb7a78d47a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NowExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/now.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9b73a2e2a7c4c66343ced71369c10b03183a3c5ef7d5f66350576df04bf4de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg_compaction/iceberg_compactor_runner.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). 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":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa70786796ee795b035f02fd1b68bd754fa592d109bc7aee2dd3e509a718f10e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/recovery.rs: FileTooLong \u2014 798 significant 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: GlobalBarrierWorkerContextImpl (317-1105). The bar is 500 significant lines; this is 298 over it, 1.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/context/recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec301f54f3db3f178160cb6d8c5b16184920691422a2a296dfc04ee909fb3c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/mod.rs: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: IcebergCommon (3 blocks, 57-1214). The bar is 500 significant lines; this is 297 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b82f33403ad0f3d9ab6776065f1cc5fee789ddff19b209f067537a317f9e0d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OverPartition: ClassTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 95-1115. The bar is 400 significant lines; this is 236 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the 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/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e444497b174f6ac1e9bd3c8289f5bbf3ccd90b413956ef4d1ddc45fcca0d7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/ddl.rs: FileTooLong \u2014 795 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 295 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":"src/sqlparser/src/ast/ddl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36694863eeba1086d49861b2da1ae99daeb17e8d212caed885bccad78b08569b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FragmentDependencyGraph.FragmentDependencyGraph: FunctionTooLong \u2014 FragmentDependencyGraph 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":"dashboard/components/FragmentDependencyGraph.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ef718ea225c70bcffb03095ad419a101f280e9fc95601e9a54e8b7a84c3f84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalVectorSearch.to_batch: MethodTooLong \u2014 to_batch runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_vector_search.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15c834911fd6a1a2d6559ae048cd8b433d673e9267fc3b693d406a7b6d47638"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/hummock_storage.rs: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 294 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":"src/storage/src/hummock/store/hummock_storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcae761b66f099ca096f58233e59619ec107254e041026324288e005fe041d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snowflake_redshift/redshift.rs: FileTooLong \u2014 792 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 292 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/snowflake_redshift/redshift.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7996b4977907708bf0750d7e24f89d7c3ad39256f3b254613a415b307b0bdc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kv_log_store/serde.rs: FileTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 289 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":"src/stream/src/common/log_store_impl/kv_log_store/serde.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae8ff7a4926941459d9a70b315778233d68edef8436835ddf96d0c1b3050a92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/stream_manager.rs: FileTooLong \u2014 786 significant 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: GlobalStreamManager (2 blocks, 319-1179). The bar is 500 significant lines; this is 286 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c44e85cc4f839c8b5c6402ad891001b4c9134366f6f494dc347d7e7f6e05606"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgresConnection: ClassTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 228 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/PostgresConnection.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f01ec4b784269dc9798b8c132d95dd45595cf129a179be3f2c912834e029d2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SourceBackfillExecutorInner: ClassTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 90-1255. The bar is 400 significant lines; this is 227 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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50f578bac8d0933cb9040bacb29b39f8275f7e3ee353b82667b102a8544965c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mview/materialize.rs: FileTooLong \u2014 780 significant 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 88% of them inside a single declaration: MaterializeExecutor (5 blocks, 68-1212). The bar is 500 significant lines; this is 280 over it, 1.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":"src/stream/src/executor/mview/materialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a22c4999c7f0dda109acb6f165fd788af1b9537943f8a3d4184444d4818de1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cdc/cdc_backfill.rs: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: CdcBackfillExecutor (3 blocks, 119-1212). The bar is 500 significant lines; this is 279 over it, 1.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":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5c2e4794c0426cc789b04ded7dbce42f106024612cb1cdfea7d78350ca6e13"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CdcBackfillExecutor: ClassTooLong \u2014 621 significant 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 119-1212. The bar is 400 significant lines; this is 221 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6243f84d728d6d223af67bd5dee1586d3388086d3eb37b8f6900c2ca67ee54b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KafkaSplitReader.into_data_event_stream: MethodTooLong \u2014 into_data_event_stream runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/kafka/source/reader.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8872fb54605b576e730eceb7f8a65bc4e5f68f474c50bb816770e71fa8ce8cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Planner.plan_iceberg_table: MethodTooLong \u2014 plan_iceberg_table runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/planner/relation.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1028f48178932c67fa035ead6c73b19296ac7405af534ad3651ca4b3e25a9343"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.clean_dirty_creating_jobs: MethodTooLong \u2014 clean_dirty_creating_jobs 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":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adb861f06dc817d2074d368a0b47db0726ff5329986e1383e59528a3c71fb98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/mod.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), about 88% of them inside a single declaration: Binder (49-1064). 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":"src/frontend/src/binder/expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66315bdb38d72b170ba747e0b36a469585657184e766055ee17702d91b534f87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/dispatch.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). 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":"src/stream/src/executor/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"882780231224f07dccc5babc2cfbccb5acc5b3fe9f6b975f669454c3c5849da0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/writer.rs: FileTooLong \u2014 767 significant 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 62% of them inside a single declaration: IcebergSinkWriterInner (2 blocks, 235-914). The bar is 500 significant lines; this is 267 over it, 1.53\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66b68f317f0389587d2772e08394a3196c229b5feb2f4290ea821a151bcad20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: distributed/stage.rs: FileTooLong \u2014 767 significant 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 75% of them inside a single declaration: StageRunner (2 blocks, 127-1144). The bar is 500 significant lines; this is 267 over it, 1.53\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1c1507a053294c9806561179e91d4e14e044c9cf5b29f946cdd6530397f968"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Planner: TooManyMethods \u2014 46 methods, declared across 12 files: planner/relation.rs (21), planner/select.rs (8), planner/mod.rs (7), planner/set_operation.rs (2), \u002B8 more file(s). The bar is 30 methods; this is 16 over it, 1.53\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":"src/frontend/src/planner/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4df6b7c73883c012bf8f3bc48e94a5e60b14816afd951e3f682154bad55a85c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StateTableInner: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f20700f81f3a520f11c00712c4c5043f09e33aeb67e29567efd202e0664b9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_table::generate_stream_graph_for_replace_table: FunctionTooLong \u2014 risingwave_frontend::handler::create_table::generate_stream_graph_for_replace_table runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e72eaa55ea0ae60980fa8a261200fd0e8f74191e1970f4a57554d109181358"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SinkExecutor.execute_consume_log: MethodTooLong \u2014 execute_consume_log runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/sink.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb9ba22578bb3b00fc2dff189028cd610feb6ec93b35507537e2369e4a095aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/commit.rs: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: IcebergSinkCommitter (5 blocks, 242-1082). The bar is 500 significant lines; this is 264 over it, 1.53\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/commit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8691bdf6e3a03b78c3e56ca5c1e7a6c363f0c00a8ba1d5c6b8eba7818c94edaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/s3.rs: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 263 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/object_store/src/object/s3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bcb4a7371ce66a16d79584bc92d28cad3f88c4f42e268b1055269950b8bee3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/local_hummock_storage.rs: FileTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 262 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/local_hummock_storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"213f54a04b55e78653c60fec8cb25ca1e0b7cc6f9dce6f7e43b178c861798c3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/interval.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: Interval (27 blocks, 44-1470). The bar is 500 significant lines; this is 260 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/types/interval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe5071096a506c56f4927ec2d86dd0605942fd72d34e21729c82455d87e70a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: planner/relation.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Planner (65-1002). The bar is 500 significant lines; this is 260 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/planner/relation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d643feae65547447160060b95bc9c040893b84e15fa15703f08ddaf83db1ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: event_handler/hummock_event_handler.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: HummockEventHandler (4 blocks, 328-1077). The bar is 500 significant lines; this is 260 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/event_handler/hummock_event_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5d813e607448574d8b3331e2e18f611221f0c5a9b7e02c9ea9252015941f1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.try_abort_creating_streaming_job: MethodTooLong \u2014 try_abort_creating_streaming_job runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac382ff0f190fd0d76b0a3c3edd151b8886487f96da4fa8f874596a94d20a2c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReplayWorker.handle_record: MethodTooLong \u2014 handle_record runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_trace/src/replay/worker.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2060d389a84d245cede6b32f438beeaf7be31f2d47b3dfc51a680a387fb9d15d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::catalog::system_catalog::rw_catalog::rw_relation_info::read_relation_info: FunctionTooLong \u2014 risingwave_frontend::catalog::system_catalog::rw_catalog::rw_relation_info::read_relation_info 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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8afee64ff58c774ce4f7cd36e772a34fc23634e498d30c1380459cf73d48978"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.report_compact_tasks_impl: MethodTooLong \u2014 report_compact_tasks_impl runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"869a1d6503c61118424ba805b53a7e817163c7b9c8760faa43cc6ed91d09e880"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlController.create_streaming_job: MethodTooLong \u2014 create_streaming_job 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":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c647a3e9effc72b3b8a3a5076868272def47908c93e6273fb8c042b5dba1812e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateTableBuilder.build_inner: MethodTooLong \u2014 build_inner 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":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69ef439788ea2c762194ac03adbb36774824ae3ef1ecd77998556612a831470"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IcebergSinkCommitter: ClassTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 5 blocks, lines 242-1082. The bar is 400 significant lines; this is 202 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":"src/connector/src/sink/iceberg/commit.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1d1d68ffafc338229c2b238223a4b9a385761c83ddfc73eb54c2e52f35edd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/sqlserver.rs: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 252 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/connector/src/sink/sqlserver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda7cc6c7b411c2e0b4bcab3de3567829dd298e4bec461884e8b0d3a0a9c62f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgresConnection: 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/PostgresConnection.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fcf8c3a8335feee446c23dc07eb8a5a246be0d66daddc221eab583e4e436c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InflightDatabaseInfo: 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":"src/meta/src/barrier/info.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b231d4ffc78467e302a1c7ff423aa40056476b030fc614f61ed045ac223ec7b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HummockStateStoreMetrics: TooManyFields \u2014 45 stored fields beside 2 methods. The bar is 30 stored fields; this is 15 over it, 1.50\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/monitor/hummock_state_store_metrics.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e70ab3f1376650a904ab3f8e9d03cc08ac5fd4f407bb9fc63f1a270f06ca79b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dashboard/mod.rs: FileTooLong \u2014 750 significant lines (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 250 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/meta/src/dashboard/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815753070062085015d14153ef590169e19f7dad7fb15fd4bc3302b71a79cff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::stream_fragmenter::rewrite::delta_join::build_delta_join_inner: FunctionTooLong \u2014 risingwave_frontend::stream_fragmenter::rewrite::delta_join::build_delta_join_inner 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":"src/frontend/src/stream_fragmenter/rewrite/delta_join.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f589282e524764283867cca5a97aca806a3bb346bc5629b1cb5e869560adc759"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/big_query.rs: FileTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 249 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/big_query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa93350688053d516600628fadf78b7b3b6e3cd3ce905ace5f1d2d26485f89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"src/ctl/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"131f8ba196c29b19ce7b4de777841d7e392ae9e65cf672bc7f2839436456e9e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cpu_profiling.CpuProfiling: FunctionTooLong \u2014 CpuProfiling runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/pages/cpu_profiling.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81dd9238d1a7e284cd490ca742b5775b76b5f1a52f67a4d9f238bd8f4204a53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashJoinExecutor.into_stream: MethodTooLong \u2014 into_stream runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fcb753d5371c9c6aec1a578af266676148670338a427adc631d3e8a0b75435"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobalStreamManager: ClassTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 319-1179. The bar is 400 significant lines; this is 195 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e9c4b9704b54c435be2a9aa3a37b1f9d3a62bb61e99f0c8b40817dfbb96bd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: event_handler/refiller.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":"src/storage/src/hummock/event_handler/refiller.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40fc21776932c62f5402b3453b7f1df8f1f0bf6b6af2593c09769a0050f4bf4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpecificParserConfig.new: MethodTooLong \u2014 new 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":"src/connector/src/parser/config.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d220b9d028bf76624310604b878a5910f0645f19e93a331f1410c95c2064b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FrontendObserverNode.handle_catalog_notification: MethodTooLong \u2014 handle_catalog_notification 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":"src/frontend/src/observer/observer_manager.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3890606eb3d0306d81df5f2cdf7e2de2e16482bc77fc2c278111a87409fe395a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PullUpCorrelatedPredicateAggRule.apply: MethodTooLong \u2014 apply 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":"src/frontend/src/optimizer/rule/pull_up_correlated_predicate_agg_rule.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d58765cb70857a11aaaa53e9c713ce1227ab6a2d8a8c77f29589aa73bf91db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Binding: 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":"java/java-binding/src/main/java/com/risingwave/java/binding/Binding.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"be999f17aa91e89207df67257822c234eb46f7e77f49fab719bb9bb4269d1612"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataChunk: TooManyMethods \u2014 44 methods, declared across 3 files: array/data_chunk.rs (40), array/data_chunk_iter.rs (3), hash/key_v2.rs (1). 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":"src/common/src/array/data_chunk.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"92910cda7e9d227affce95569c409ea69480f795e1832b1e1a4796d73e0bfa2a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NexmarkProperties: TooManyFields \u2014 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/nexmark/mod.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"31595328c74129e9c3b97b58e5644970bd727260eba3ee2781489344fbe6361d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: external/postgres.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: PostgresExternalTableReader (3 blocks, 146-839). The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27d94f2793641da6e0530f4fff1bcc63ff69f9c692590f2f0007a692d691545"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionImpl: ClassTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 3 blocks, lines 747-1943. The bar is 400 significant lines; this is 184 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":"src/frontend/src/session.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66c44a1e466f1418f3ea68a7bf8fcb94d99776e1b72d5923145218be2626312"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier_worker/mod.rs: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: LocalBarrierWorker (3 blocks, 303-1120). The bar is 500 significant lines; this is 230 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/task/barrier_worker/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff498243ae2a929eed7636d4c565a8c239b7b9c674cc2a3a9c1ce64a4756213"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoordinatedLogSinker.consume_log_and_sink: MethodTooLong \u2014 consume_log_and_sink runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/coordinate.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d050ac135fd4b53906400a627bfa2d9c13a34425b7d07092b625b9addbd12e56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlController.build_stream_job: MethodTooLong \u2014 build_stream_job runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcefb9a2084f0b47fcbd92d5863b3b2ec05d6a51f4d7312d322b0a3dc813947"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergCompactionPlanRunner.compact_impl: MethodTooLong \u2014 compact_impl runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"62639f3bd9d48eeff09032e8c1693edacd1b96eed9e74216c1defbc2aee8c262"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamScanExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/stream_scan.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6873e50fa69adcb9ecbdcc1e99731528e02684ecc7b12743ddce5d42bcd93f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.finish_streaming_job_inner: MethodTooLong \u2014 finish_streaming_job_inner 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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b84de393d12ed3ec907131cd97e0a213cde68d12eb6a4e6475c1af8f92cdf96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cdc/cdc_backill_v2.rs: FileTooLong \u2014 723 significant 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 72% of them inside a single declaration: ParallelizedCdcBackfillExecutor (3 blocks, 51-1106). The bar is 500 significant lines; this is 223 over it, 1.45\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b023fa40cd6e5f988035a83fe9acd574fdc638699b28fae5434f494cba8498"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StageRunner: ClassTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 127-1144. The bar is 400 significant lines; this is 177 over it, 1.44\u00D7 the bar. To reduce it, group the members that share the 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/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2114e9bde6ffd89e46ea0614dd3c4b22e24322a9b62c386b41ab547d30bd07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsOfJoinExecutor.into_stream: MethodTooLong \u2014 into_stream runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0034a57c6cba69c224c33055c3f1629b324ae411571000c9e2a489eeebfb3826"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchPosixFsFetchExecutor.into_stream: MethodTooLong \u2014 into_stream runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4b3f1b9f1f258cdde5198385226802dffe78561fea5f234f0152775da5bb79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TableCatalog: TooManyFields \u2014 43 stored fields beside 49 methods. The bar is 30 stored fields; this is 13 over it, 1.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/table_catalog.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"213dd7fa6c094872d8f8362a91feb074a39c8d7c707424b50f1fd8d4ef75b968"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgresConnectorConfig: 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresConnectorConfig.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0402b68f86c1bf9ed4493a6161808e4cc32206175813373bd031cd0303489ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicalJoin: 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":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e078295fd134a14a9b122581a5b025f75f2ad623e612a37b233d68dfde6f44c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalAgg: ClassTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 11 blocks, lines 67-1576. The bar is 400 significant lines; this is 173 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":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccd2c1601b47b52f721bfaeb5727ee2d48345a9c81f8988af655beb60a18483"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ListValue.from_str: MethodTooLong \u2014 from_str runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/array/list_array.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b52d2d9859ed2d9925203e880c60c0ba68745eeca50c7c3ac3b7ab4caa72c40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableFunction.new_file_scan: MethodTooLong \u2014 new_file_scan runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/table_function.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"641a3beef7b1ae6a0b58dc2962ab6d699e04d3a1d742d133528b6640739aaf01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Migration.up: MethodTooLong \u2014 up runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/model/migration/src/m20231008_020431_hummock.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d916cb5bf12cd36ba9594cfa43b82208ba56757fc06e07f3c16f4e5dca84cf0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mutation.from_protobuf: MethodTooLong \u2014 from_protobuf runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mod.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f65cb454b7a7252548105b3f50ecd131f34a0bce5d9873a05dcd974fe863d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/func.rs: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b895c9799c08a782b324c3f55627cde43e9c42785f072063f0fc5252057df5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/asof_join.rs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: AsOfJoinExecutor (4 blocks, 96-1005). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8386777e2e2982701ba5927322d703118762a68187f5db0d6abb95cb970ba3ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_expr_inner: MethodTooLong \u2014 bind_expr_inner 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":"src/frontend/src/binder/expr/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6b833f6665c6465b13bbf252d16e70ef2043e4b9643010e115c333e3486847"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_catalog_relation_by_name: MethodTooLong \u2014 bind_catalog_relation_by_name 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":"src/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1e97e24672497867fa0c4f914dabb136c1be02596ebcb69bea1455dba6bd9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PullUpHopRule.apply: MethodTooLong \u2014 apply 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":"src/frontend/src/optimizer/rule/pull_up_hop_rule.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9787a69346d2793c6e6341110b9efdea5746818b51d17216728f304522d795"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DmlExecutor.execute_inner: MethodTooLong \u2014 execute_inner 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":"src/stream/src/executor/dml.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee445af0312c3c4416ea054fdb30613231b18c4c92522ddf428284977331743"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HummockVersionReader: ClassTooLong \u2014 567 significant 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, 3 blocks, lines 587-1359. The bar is 400 significant lines; this is 167 over it, 1.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c63b92b8d26cc77105d55f5ea5b7937efcef39c2a236a0db592811d1b42157"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/mod.rs: FileTooLong \u2014 707 significant 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: ExprImpl (4 blocks, 196-1112). The bar is 500 significant lines; this is 207 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe29ed62433986c252aa2470fb90020a06aca44ea804efd3f947653969dd8db4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::sink::iceberg::create_table::create_table_if_not_exists_impl: FunctionTooLong \u2014 risingwave_connector::sink::iceberg::create_table::create_table_if_not_exists_impl 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":"src/connector/src/sink/iceberg/create_table.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2b7745de41356921d68f63d5922cb5a5e793330e557354472873157790fbd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemoteLogSinker.consume_log_and_sink: MethodTooLong \u2014 consume_log_and_sink 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":"src/connector/src/sink/remote.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c7cee7989f0a2a9663c71f91cb8064a7e96eebab705d3b3dd484a2410eb3e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/context_impl.rs: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"src/meta/src/barrier/context/context_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dda5ddd967cd340c0c6050f77901fdbba287efd94937e0b958cd0959852a096"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::sink::encoder::avro::on_field: FunctionTooLong \u2014 risingwave_connector::sink::encoder::avro::on_field 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":"src/connector/src/sink/encoder/avro.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d34d1eba8997d102d7e9a73363b2ff53e262abcd70e1e14647f35877498029"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::sink::encoder::json::datum_to_json_object: FunctionTooLong \u2014 risingwave_connector::sink::encoder::json::datum_to_json_object 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":"src/connector/src/sink/encoder/json.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c358bf1f17ae559e26b127fb717f31dfb991b3600b11ccaf6320bde4974f1ab0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemporalJoinExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor 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":"src/stream/src/from_proto/temporal_join.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f566e5c2a533a28964b4e942cfa4a87f456bd424c289aa635d154678a3220b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApplyJoinTransposeRule.push_apply_both_side: MethodTooLong \u2014 push_apply_both_side runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"226dec64be03cd62976dc07610a18ea17a889c3f1ca0df5663b17669451cf6a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IcebergCommon: ClassTooLong \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), 19 methods, 3 blocks, lines 57-1214. The bar is 400 significant lines; this is 154 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":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d181131bf526c843f69662120f6d6211da6e62e04453ffeb3b25ddb8e4002e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergSinkCommitter.commit_data_impl: MethodTooLong \u2014 commit_data_impl 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":"src/connector/src/sink/iceberg/commit.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48340ccaadc11dc547ea4674b70ca021be23cacbcbb39b8026b78a938ca6af1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::alter_set_schema::handle_alter_set_schema: FunctionTooLong \u2014 risingwave_frontend::handler::alter_set_schema::handle_alter_set_schema 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":"src/frontend/src/handler/alter_set_schema.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a369ad71e355aa05b11a4a623095607b5e429476e4a69a274658f776dc0b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_object_store::object::build_remote_object_store: FunctionTooLong \u2014 risingwave_object_store::object::build_remote_object_store 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":"src/object_store/src/object/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c10f8e3635c351fc41ae2bfae5e97a93d60983d9af6efd02a6bfd3ac98fcdc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConsumeUpstreamStream.poll_next: MethodTooLong \u2014 poll_next 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":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b105aa657aacf7607c7b8231bf93fddc5ea12c38f518cef53da7d4395eca25a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: over_window/over_partition.rs: FileTooLong \u2014 687 significant 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 93% of them inside a single declaration: OverPartition (2 blocks, 95-1115). The bar is 500 significant lines; this is 187 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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b249c4222cfe89aeaaf2b92559d0afe61274a5a291cbeb17f3e652c9a6389fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/catalog_service.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), about 66% of them inside a single declaration: CatalogWriterImpl (3 blocks, 314-888). The bar is 500 significant lines; this is 186 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":"src/frontend/src/catalog/catalog_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee911f09c932581c2d56615c2f72ebba8bb2524e271b4c900ddb1e3738e8a3ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_gap_fill: MethodTooLong \u2014 bind_gap_fill 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":"src/frontend/src/binder/relation/gap_fill.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4a2a4abe41cd6420c23b11d591ffe0fff5a48bf9fc837dff620f1e7f62fc13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NavExtractor.rewrite: MethodTooLong \u2014 rewrite 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e70d7a32197e54abab3303c634d0259677ee6d2132759109387e0e78fcc1b79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.revoke_privilege: MethodTooLong \u2014 revoke_privilege 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":"src/meta/src/controller/user.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae030fe69ff3977a6c75c27740405c44b5df05194cf45bc3283c02b3305a3bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyncedKvLogStoreMetrics.new: MethodTooLong \u2014 new runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/sync_kv_log_store.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6675cce81f30ab2c8bdd762f0438ac9d7d840fc0f33b57ad1fc8a71b9f733f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OptimizerContext: 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":"src/frontend/src/optimizer/optimizer_context.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe0650527ad8199fae5b0cdb29ea31c7126f3b944544d94ebd1a763082a2a47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IcebergCommon: TooManyFields \u2014 41 stored fields beside 19 methods. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"66372761353e8550ef2fc1d07cec183e53af174013b78b8dd2e1042696062ee0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connection/PostgresConnection.java: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: PostgresConnection (85-1076). The bar is 500 significant lines; this is 183 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/PostgresConnection.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd4415b1163561f7a3e92f62e5b3843c5b9217b89327eef628cd2a9d137e84b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controller/cluster.rs: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 183 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/cluster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edd06ef300b23a0c3e27cb616750e38173abfbc621d0b314026558e6928622d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink_coordination/coordinator_worker.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":"src/meta/src/manager/sink_coordination/coordinator_worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b370ad4b6de716a4c331672fedf79f2ccf98c4eba3ec545df018b5fffdd20b89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::hummock::metrics_utils::trigger_sst_stat: FunctionTooLong \u2014 risingwave_meta::hummock::metrics_utils::trigger_sst_stat 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":"src/meta/src/hummock/metrics_utils.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7822198163a84986984434add9b8eca5acfbefcddd7f877f061a9340520c6e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchOpendalFsFetchExecutor.into_stream: MethodTooLong \u2014 into_stream 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":"src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a8f199030cac72af9e4f82d9c7138223b85e433cd29206653289cf3547d74e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchRecognizeExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor 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":"src/stream/src/from_proto/match_recognize.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3776e61817a83669ef174b3f0c7ae911ab93a524bb1e3da0080b0ea55e5fe8b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CatalogController: ClassTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 220 methods, 4 blocks, lines 119-1057. The bar is 400 significant lines; this is 141 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"094c530660069320c1b232c01a408706ef79885fd567f52098fae71385405db5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: function/mod.rs: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Binder (86-999). The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/function/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f6cb68c4281d9f2cbd849fd31e48c7cefafa937684e8e5bea7877a8a8be362"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RdKafkaStats.new: MethodTooLong \u2014 new 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":"src/connector/src/source/kafka/stats.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"551f4aff34382e86f09e877d1d11f2401a70377bd66dc8745c233fa9d1f533b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergIntermediateScanRule.apply: MethodTooLong \u2014 apply 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":"src/frontend/src/optimizer/rule/iceberg_intermediate_scan_rule.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"067c2caf13b0a49036cf048ae05bb21a313b609ceb7a6a378acefef2e61146dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::shared_buffer_compact::compact_shared_buffer: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::shared_buffer_compact::compact_shared_buffer 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":"src/storage/src/hummock/compactor/shared_buffer_compact.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ce68c48ba2ed09f1725a58062d318cf21c8046dee375c18f33503615b33c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockVersionReader.iter_inner: MethodTooLong \u2014 iter_inner 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":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4647fe64c2b62c57ba235cf89a074ea47db8da47e60ba837488f0b192ae4323"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_common::util::stream_graph_visitor::visit_stream_node_tables_inner: FunctionTooLong \u2014 risingwave_common::util::stream_graph_visitor::visit_stream_node_tables_inner 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":"src/common/src/util/stream_graph_visitor.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92631d821cf9aba246e26480743c282a99fad81a57c8896b562f0f25278bbc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::parser::unified::debezium::extract_bson_field: FunctionTooLong \u2014 risingwave_connector::parser::unified::debezium::extract_bson_field 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"47943be1e965bb2a9127a9cb399ce2234ea448f044c7ceab023f6974f6ccf6eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 669 significant 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: TestCase (3 blocks, 124-912). The bar is 500 significant lines; this is 169 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7605f07d395db7a246ce2caafac67eab8e8ddbf87e72b51a4f39a7e4c32df5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manager/time_travel.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), about 88% of them inside a single declaration: HummockManager (46-810). The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"748c1d757a093475e3e31cb0f96e05952c88307beff5e8afcc67d69a297a8022"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PgOutputMessageDecoder: ClassTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 134 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/pgoutput/PgOutputMessageDecoder.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"980191d65c176cc268cde5dc222aa625708cf074755c9a983ad5800dc20d23db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: risingwave_common::util::value_encoding: 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/common/src/util/value_encoding/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f349baeea6af8aaac3d09d4d8b964665867f3ad1281d27509b6709409823dfb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SqlServerStreamingChangeEventSource: ClassTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 132 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/sqlserver/SqlServerStreamingChangeEventSource.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fc4321900dac7ec8ad752336862f967914c675694ac9b2a4c1243c215c622b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: external/mysql.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). The bar is 500 significant lines; this is 165 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":"src/connector/src/source/cdc/external/mysql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48630ed06d5d5ccdf0a2571cdde1f85c30b3e61d86d9bfa3d7294155a9e91ceb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceMetrics.new: MethodTooLong \u2014 new 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":"src/connector/src/source/monitor/metrics.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"12801258ee4a7c502187b9df189a509a78d52f3024047da8d7947be8c5a7d889"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SinkExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor 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":"src/stream/src/from_proto/sink.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e8a6da1314c9e26eab8e859d595ec6ea793fe0ade312c4491673d92387ad8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: function/builtin_scalar.rs: FileTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: Binder (30-905). The bar is 500 significant lines; this is 164 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":"src/frontend/src/binder/expr/function/builtin_scalar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e995e119e1dbc6302687f7afe171357a595d05f6fd0427771f28a50116e9bb9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Interval: ClassTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 27 blocks, lines 44-1470. The bar is 400 significant lines; this is 130 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/common/src/types/interval.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7901f34ab8a82d1d91868634da9d73664aca9218748bb10bb35dbbd8cf3d7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compactor/compactor_runner.rs: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 161 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compactor_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b994e6d739dbfd3c4f26acf4626abee3f3fa53abf916a200a76fc469dc2f6bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::webhook::websocket::try_handle_connection: FunctionTooLong \u2014 risingwave_frontend::webhook::websocket::try_handle_connection 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":"src/frontend/src/webhook/websocket.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb513b33d5a46503b65f598e091631189a0a5ee4de4c863a0cbf5a35c303f278"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.create_source: MethodTooLong \u2014 create_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":"src/meta/src/controller/catalog/create_op.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbafc95911895c2f38e4bcd1bfc5c6abceec6192729d41c946c1d2937fb5c76b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sstable/builder.rs: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: SstableBuilder (3 blocks, 136-800). 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":"src/storage/src/hummock/sstable/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5309ffc94f3ac29cb7b5bf82cc5def14bfe2b995a8cc704b0ee3c9379e4cbeb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/starrocks.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/starrocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43481f96ac0681e8cfe56c7425553195b2a2876ce44343c570c1d1a8ce9255e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::controller::scale::render_actors_with_allocator: FunctionTooLong \u2014 risingwave_meta::controller::scale::render_actors_with_allocator 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":"src/meta/src/controller/scale.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2db687658bc2957630f011c63bc92640e86a8b7fcaedc2a6f36f3ec08500f4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_alter_table: MethodTooLong \u2014 parse_alter_table 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7ff71de24c90f4008b086a78d761cf293ffed1b7c4f6542f1417b125e8e8c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GapFillExecutor.generate_filled_rows_between_static: MethodTooLong \u2014 generate_filled_rows_between_static 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":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b9c99b4e902363f1f7d89a88c75f39d88493f597ce9673b16828dbdfe0e662"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FsFetchExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor 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":"src/stream/src/from_proto/source/fs_fetch.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9685b7fa2dc80055716e687ce036d83c0e2d9392544c8d21b3be3d1d05174f44"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StateTableInner: ClassTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 9 blocks, lines 188-2413. 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":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b533b0c0f0d8eb6e5d17145ed2fca22286bcdd8a8396d2833177a9495def1d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParallelizedCdcBackfillExecutor: ClassTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 3 blocks, lines 51-1106. The bar is 400 significant lines; this is 121 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":"src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a93bf349b0869347fcb80d4ebf85840d4e672d04466e44f54f34e642f8d6dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.resolve_binary_operator: MethodTooLong \u2014 resolve_binary_operator runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/binary_op.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc2152c7eb3ce4bfe59224539ba1a03f5dfe4bd73dd1b9f6cdba0c55cea971e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogController.grant_default_privileges: MethodTooLong \u2014 grant_default_privileges runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/user.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98b56b3f96abae6dac3fe563ed5753fa0cb50b340571cdf98fd26b6e69da906"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DynamicFilterExecutor.execute_inner: MethodTooLong \u2014 execute_inner runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c10a17f7332208441b4688de962cfd98a94f741aa0aec1c6eab1566418790f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tokenizer.rs: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: Tokenizer (2 blocks, 315-1033). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"706debbe244dae4390a4553b77e9b441faa4e846da01c785b233183a6649cd36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/progress.rs: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"src/meta/src/barrier/progress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5185c9d8632f94f1fa664791a35dd23defa25877df39080e8d12435a1235b8ec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgresExternalTableReader: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 3 blocks, lines 146-839. The bar is 400 significant lines; this is 116 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the 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/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbd7fb791c01a4ae10af5749e1e284e3b7fe0c48a4d4069be8647078b385f78"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StreamMaterialize: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 5 blocks, lines 53-753. The bar is 400 significant lines; this is 116 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the 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/frontend/src/optimizer/plan_node/stream_materialize.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1156f632feeb2cb1727da8ddc13e00db27d5b58e23e3742fae502e5ec0b576"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rule/index_selection_rule.rs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: IndexSelectionRule (3 blocks, 92-1010). The bar is 500 significant lines; this is 145 over it, 1.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/index_selection_rule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e797a56d18201ac7e52f778730a03f67bea2643605b4e82d9920bcce4bd58969"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceStreamChunkRowWriter.do_action: MethodTooLong \u2014 do_action 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":"src/connector/src/parser/chunk_builder.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"989037aafa8ad715f5e2f2d5626e122fd4b9ea31405f0deb31932b4344b4a393"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_function::handle_create_function: FunctionTooLong \u2014 risingwave_frontend::handler::create_function::handle_create_function 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":"src/frontend/src/handler/create_function.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1dc0eb95cf58c78637061c9797c0910ef0f8831697dcb51bada217bc0dd245"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Condition.disjunctions_to_scan_ranges: MethodTooLong \u2014 disjunctions_to_scan_ranges 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b9e4c7cdfd75160227bbfa673c90a60712a13665e5e69e9f5d04357c6ac420"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyncedKvLogStoreExecutor.execute_inner: MethodTooLong \u2014 execute_inner 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":"src/stream/src/executor/sync_kv_log_store.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"2426ec452db6cb5de4cd287f96dd931d76b34a7c72cdc308feb972514902088b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HummockEventHandler: ClassTooLong \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), 22 methods, 4 blocks, lines 328-1077. The bar is 400 significant lines; this is 113 over it, 1.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":"src/storage/src/hummock/event_handler/hummock_event_handler.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d3d1288afc7106aa84f3e474de0a4198be6136e66e5f2948325722e5228001"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: match_recognize/nfa.rs: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 141 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/match_recognize/nfa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8cb831ab3833f774cebdf4acdf65f1261000857a2b29479938dd7000988b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::controller::utils::validate_restrict_drop_and_collect_owned_objects: FunctionTooLong \u2014 risingwave_meta::controller::utils::validate_restrict_drop_and_collect_owned_objects 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/meta/src/controller/utils.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"659e70c86c419f3cde3f1e48bcf446a9939bbc9c3ea3a009212714600e80eed7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.write_time_travel_metadata: MethodTooLong \u2014 write_time_travel_metadata 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/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"0163cd3d82a690ffa89f3c7fe94028b0d0f632ba131ce6f4f1e5e0ec02126300"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlController.build_replace_job: MethodTooLong \u2014 build_replace_job 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/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f36543827f62f39ccce13d681c4cea6ddd5f3847bca0c2294fad340a38866c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubscriptionCursor: ClassTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 2 blocks, lines 407-1084. The bar is 400 significant lines; this is 110 over it, 1.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":"src/frontend/src/session/cursor_manager.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad712e86973254f2f3a6b4e6a6b9282836bbbaf7c62947ea0e2854f1bf9c4e59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/variant.rs: FileTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 135 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/types/variant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8961f479fd1cfc8867d2e447fb3c87162724e0c5848de1db8f12aef1ea792a0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/base.rs: FileTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 135 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a994ba7f9de1911f3e072b6bcc698d94cbcedafbba63ce775d0a59718ace9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/stream_sink.rs: FileTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: StreamSink (5 blocks, 179-986). The bar is 500 significant lines; this is 135 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cb4873bfaaf4dcad5e4410f70d616fef1b9200b80b0d4a20203c81fc60ee9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Command.reschedule_to_mutation: MethodTooLong \u2014 reschedule_to_mutation 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":"src/meta/src/barrier/command.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"538d7661f525e23b64de3053eb6e2527b50dae554e1099820a55ebdbe96f72b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::dashboard::handlers::get_streaming_stats_from_prometheus: FunctionTooLong \u2014 risingwave_meta::dashboard::handlers::get_streaming_stats_from_prometheus 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":"src/meta/src/dashboard/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8abddd68dc7f63f5ec917ad93f8373314de1cc58eb3a8d09179263de3e6858"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergCompactionManager.check_and_rewrite_manifests: MethodTooLong \u2014 check_and_rewrite_manifests 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":"src/meta/src/manager/iceberg_compaction/gc.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae7c22caf9be80080ca67b792776e8ee403abf0e59b62da23707e3eba6639e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsOfJoinExecutor.eq_join_left: MethodTooLong \u2014 eq_join_left 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":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"37390f56754bbdc445a87e8f5f94f86877266810c60955d53d97d2a42f77f1ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Interval: 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":"src/common/src/types/interval.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2417dc715a97475047957406ac0adb116f0b5b55ac88b92f7e01964e900f7962"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MetadataV2: 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":"src/storage/backup/src/meta_snapshot_v2.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01f6f0f9bff1411909bb542c463b8442a91560990054c0718d5992ae9f4d0f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: monitor/hummock_state_store_metrics.rs: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: HummockStateStoreMetrics (2 blocks, 43-683). The bar is 500 significant lines; this is 133 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/monitor/hummock_state_store_metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"719c413294b52dab7c80ab87a14736b60e5fbb62c1f337a4f9456acd7d1256b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/temporal_join.rs: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 133 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7e9accabb314832791b6303f0f86fe00363239bf14f450cfbc8ba2cdfd65ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postgresql/PostgresStreamingChangeEventSource.java: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6739225d0dd563015512e2cbefeec33d90eeffae871409ff2b1944c83c43042"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cache.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"176ca0ce542ed7f0b6b063921cc3d86f56751c105ae032eed53b391937e41bf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/get_op.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: CatalogController (28-795). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/get_op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79aac85783e9d5684eb9ddc18d35a2883f9898fe6ba609a30de734ef0f78621"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_expr_impl::scalar::to_char::format_inner: FunctionTooLong \u2014 risingwave_expr_impl::scalar::to_char::format_inner runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/to_char.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f8f57fe0eee4d5bb0207a9480d772d131ff81f2aafd5f11ad49fa12aa8aac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::alter_table_column::handle_alter_table_column: FunctionTooLong \u2014 risingwave_frontend::handler::alter_table_column::handle_alter_table_column runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_table_column.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9ccbfd50836f20448371062f4a4c17b574f5236b470afba0317fc2ba2d2e72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_table::gen_create_table_plan_for_cdc_table: FunctionTooLong \u2014 risingwave_frontend::handler::create_table::gen_create_table_plan_for_cdc_table runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3286e4734a6c3b2597b8ace2253c31cf0061c3abb6c17e1fc3a9ad08bb307a1f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_prefix: MethodTooLong \u2014 parse_prefix runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03cfe8c5c5fd56271572e08b4afe6bb3f3aea856a555a6ec5358cc6753bb0e2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MatchRecognizeExecutor: ClassTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 3 blocks, lines 542-1547. The bar is 400 significant lines; this is 102 over it, 1.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":"src/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae06f553b308afa9038e61357e62fab6fb9b96aee3213c024752cd4b17e6147"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compaction/compaction_group_manager.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 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":"src/meta/src/hummock/manager/compaction/compaction_group_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b35cd2401b918e4c81192578cc83cc03d324ad2a06f4de7132fc8192428821"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/query.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 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":"src/sqlparser/src/ast/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb29cde1205cae2cf5eeaf1695472e100664f49d6c518ef9e8520189e2be093a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/partial_graph.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/partial_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26e4c694475ce802e7adc4ff3e93c6830007944ea61bcd0cc61a6474ff826fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClickHouseFieldWithNull.from_scalar_ref: MethodTooLong \u2014 from_scalar_ref 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":"src/connector/src/sink/clickhouse.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"42512dcf2b78cefb9358c81ed62283c806abf129f396e1971cf914a738255334"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.resolve_iceberg_metadata_relation: MethodTooLong \u2014 resolve_iceberg_metadata_relation 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":"src/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04d38f6f144954b5d85ad94ee63d92f6fd8433c5105ddb1bdde4eb3bf996fb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::catalog::system_catalog::pg_catalog::pg_class::read_pg_class_info: FunctionTooLong \u2014 risingwave_frontend::catalog::system_catalog::pg_catalog::pg_class::read_pg_class_info 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":"src/frontend/src/catalog/system_catalog/pg_catalog/pg_class.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"340467096291363411a86c563762318acaf6a0869d900c0630f046e0358fffc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::create_task_execution: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::create_task_execution 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":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fba804cd1c18516d47a65a5915670e32214eaea72dbe65099eeb8c1a127528"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hummock/metrics_utils.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":"src/meta/src/hummock/metrics_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb9ce953accb46a84ba14228395ba896ccbd36577e224bc59a4944e23fc6d86"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SinkExecutor: ClassTooLong \u2014 499 significant 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 57-974. The bar is 400 significant lines; this is 99 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":"src/stream/src/executor/sink.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"838e73af4b215bb524b23e13eef67e70b1eaed570b28c2130f0367580ff987fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/logical_optimization.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":"src/frontend/src/optimizer/logical_optimization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ff3255e3b4db6af4f39e3cb001117857a7261d1ba550f63d0e048935ef1c69"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgresValidator: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded), 16 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3713451dda803b64944b40e62e388cd982dc8297b030112c5b8d061c66ed538c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/service_config.rs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/service_config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c118c1fb899713e8a0de1bedbdf514e8fbc253e3493907ca78d6b356e71ff771"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.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). 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":"src/meta/node/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e91481ae0f71a46620fb30c09bbee2f283fb1f73986e5b5f28f04f73d626ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector_codec::decoder::avro::schema::avro_type_mapping: FunctionTooLong \u2014 risingwave_connector_codec::decoder::avro::schema::avro_type_mapping 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":"src/connector/codec/src/decoder/avro/schema.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59077e66c92ed4f1d6691dd8bdc6d121a251e304e77040854536d79564bfd73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApplyAggTransposeRule.apply: MethodTooLong \u2014 apply 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":"src/frontend/src/optimizer/rule/apply_agg_transpose_rule.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38541b84fb8603862d7679c2415e651bc4b1ea7d271ca8d614cd3acaae96aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/explain_analyze_stream_job.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 119 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":"src/frontend/src/handler/explain_analyze_stream_job.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"895ef5c754199cfea360976542a02e4c621fefdfa5a2d8ec16d93318ab2ffe40"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HummockServiceImpl: ClassTooLong \u2014 495 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 3 blocks, lines 42-722. The bar is 400 significant lines; this is 95 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":"src/meta/service/src/hummock_service.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec05be4e47ad8899b0d74bfada3e286e08da698e4771f9d55a4d263a3df9720"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generic/agg.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: Agg (6 blocks, 54-745). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c53356ae89d1d25f0a94470958c23934c755d39507d19993c8db932b85ccc5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: risingwave_expr_impl::scalar::trigonometric: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/trigonometric.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"68432985a7c28687f1bb4d69304f6fc1f8fd3e0ac8aca781c5f132a26f2fc6d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/meta.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/meta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0396e31ff46571f3e3913ed9ccf07e50161e079e95cf21dbdebe5b98940922"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connector_common/postgres.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/postgres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea29f0ce42e4a7131ea3ee559f559a03e00c3106ddbd05fc7d8dc5ebe299b603"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_infix: MethodTooLong \u2014 parse_infix 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb4e684f4ab3dc7d7e376ddd6d4d437d69c31177b15002d7039bce0b78cbd6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_compactor::server::compactor_serve: FunctionTooLong \u2014 risingwave_compactor::server::compactor_serve 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":"src/storage/compactor/src/server.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea431025b302bf1cc512115978811a84e3386efdd87829568283bafeb3b4272"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockEventHandler.handle_hummock_event: MethodTooLong \u2014 handle_hummock_event 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":"src/storage/src/hummock/event_handler/hummock_event_handler.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea933f527c37077fd5c79d1824c7cd3e2a0e4f174a4261d6cb111238cda9fc10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metrics/extract.py: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8866ec7178c2a93115eef1c0622917fa94d39ed66584f6a70dd70dadfcdfbd9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExprImpl: ClassTooLong \u2014 490 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 4 blocks, lines 196-1112. The bar is 400 significant lines; this is 90 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":"src/frontend/src/expr/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12c4a0127105610e9272c3a650344272883c1d717727ce62c779dc1b9a7e25c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/log_store.rs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 112 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":"src/connector/src/sink/log_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b28b1e8d7c76af7fa51cbb8294b840dadd4809a3e92fbd5f79bd0483ae35c5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StreamSink: ClassTooLong \u2014 488 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 5 blocks, lines 179-986. 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":"src/frontend/src/optimizer/plan_node/stream_sink.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f7ec1ec533112a510447e77ca295ebdf9e752897391160f7f0672e8cdd2bc3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalStoreMetrics.new: MethodTooLong \u2014 new 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":"src/storage/src/monitor/local_metrics.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e346e0779cdffc52f0cf13df47c86e530922d6bd66c568da66eee083d99cf17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExecutorInner.generate_filled_rows: MethodTooLong \u2014 generate_filled_rows 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":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaf3625856abe277af5159db6d58feb340546dd7b64220a087f7b60634444c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TestCase: ClassTooLong \u2014 487 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 3 blocks, lines 124-912. The bar is 400 significant lines; this is 87 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":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"467346e6486c6ec2d2bf0f137051b6f3e96fc199210539d4dba572fabf195e28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/sink.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), about 82% of them inside a single declaration: SinkExecutor (3 blocks, 57-974). The bar is 500 significant lines; this is 108 over it, 1.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b20fb3093010eea35cb3f5e63d154c2f663ff57273840c6588f19c369a3d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/turbopuffer.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/turbopuffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5767d625aa310c6778a4fc07913a7da1d8928d9a17b0cc01f94f9543f03c8726"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashJoinExecutor.handle_match_rows: MethodTooLong \u2014 handle_match_rows runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b8ab7f13abdd423dcf17f2f7766feca83d1a340e2b59d227df84417b2ae894"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColIndexMapping: TooManyMethods \u2014 36 methods, declared across 2 files: util/column_index_mapping.rs (27), utils/column_index_mapping.rs (9). 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":"src/common/src/util/column_index_mapping.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5faec4cc3d460cb9992c1f0aca86e5026f6ffe7ee3e84ee35db7b5125cb62e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IcebergConfig: TooManyFields \u2014 36 stored fields beside 24 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":"src/connector/src/sink/iceberg/config.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"70637648cbe869a57385cec1211ea8db872dea57ea302e513f0060eaaa277b42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RedisSink.validate: MethodTooLong \u2014 validate 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":"src/connector/src/sink/redis.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff8e057566774043518661774ec4a160c94f93251ca9e721d19c770cccb44bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Agg.infer_stream_agg_state: MethodTooLong \u2014 infer_stream_agg_state 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":"src/frontend/src/optimizer/plan_node/generic/agg.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc725d612f69a2c7daa3840b7cfa19f1f8fd5a72f0d8b96f1fba5ffb31a1ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetaNodeService.apply_command_args: MethodTooLong \u2014 apply_command_args 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":"src/risedevtool/src/task/meta_node_service.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8400473a5d18c2540ac244f2085ad3654155e4985a31b3d3b5f6ed19b9f94330"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/key.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":"src/storage/hummock_sdk/src/key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e833d2640b19ba6af3d6d9e2e8e05f899d5aa83188380ebb2d954a5115118e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IcebergSinkWriterInner: 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), 9 methods, 2 blocks, lines 235-914. 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":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e082468d8c57d2bb6d3cb5b1f1529b00f5a2b6472cc491d8c8215fdbb8ac22f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HummockStateStoreMetrics: 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), 2 methods, 2 blocks, lines 43-683. 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":"src/storage/src/monitor/hummock_state_store_metrics.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda33a0a87bb884ffea8a365494fc614720392e76b8d3cd673e477f44974936c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalLookupJoinExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor 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":"src/batch/executors/src/executor/join/local_lookup_join.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acc84afbb114b2e417c0df3e8516e9a8fc0b20cafe6b3cdfa4552a8468d208b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::sink::snowflake_redshift::snowflake::build_create_merge_into_task_sql: FunctionTooLong \u2014 risingwave_connector::sink::snowflake_redshift::snowflake::build_create_merge_into_task_sql 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":"src/connector/src/sink/snowflake_redshift/snowflake.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"442c2731f340ae3551ae3538721d1fa8f2b04c7702716ee8705d7692767a06f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalBarrierWorkerContextImpl.reload_runtime_info_impl: MethodTooLong \u2014 reload_runtime_info_impl 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":"src/meta/src/barrier/context/recovery.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b67a3e1cae95baedc6062778cf99ee6da9bbd102f906004f3fd4eedcc5bf5c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.load_meta_store_state_impl: MethodTooLong \u2014 load_meta_store_state_impl 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":"src/meta/src/hummock/manager/mod.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74b22eae503c5e6db717fc04fa1013c9a561e8aadef2d354f8c2cd96cfe9005"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hummock/sstable_store.rs: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: SstableStore (2 blocks, 206-854). The bar is 500 significant lines; this is 93 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9f2e7898b46eb094ae8c9c21e4c198390adb1542a324898126ab0589394468"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unified/json.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), about 76% of them inside a single declaration: JsonParseOptions (3 blocks, 191-813). The bar is 500 significant lines; this is 92 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":"src/connector/src/parser/unified/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53faf24464a232e58dc0d8b17e0eac5d6ee48744009bd8eee4b1c833905f3f01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/postgres.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":"src/connector/src/sink/postgres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc808bad095e795ca96568e6f28545e1ef5d4f8ee154cc185209cbbfbd17b36"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataChunk: ClassTooLong \u2014 472 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 6 blocks, lines 65-918. The bar is 400 significant lines; this is 72 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":"src/common/src/array/data_chunk.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bde5e06c07ffc95c7fac234641410db499961e4a3f9dfc8db60785980643fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relation_graph.StreamingGraph: FunctionTooLong \u2014 StreamingGraph 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":"dashboard/pages/relation_graph.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"35109644900aefa9951de4ce2fdefa91520dcfe946c38829f80cbfe8792b5130"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_window_function: MethodTooLong \u2014 bind_window_function 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":"src/frontend/src/binder/expr/function/window.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cd6b219d6e5e25e48a7011fee717a85a5004a8b1aa6311800bcce4b54a4e10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchRefreshJobCheckpointControl.on_new_upstream_barrier: MethodTooLong \u2014 on_new_upstream_barrier 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":"src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf2986690cef183afb4bae768ed9ee7cf7a660f8b84a25b93b65ca622caa6ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::build_task_planning_config: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::build_task_planning_config 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":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8202ad6ae4df151ef7f94957aaf8b14447ca9a9e905abe5eb51d5b1bb7cfa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::start_shared_compactor: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::start_shared_compactor 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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"809902a92358d8ba3531d10a16e759b2dd1d3ea396f1f376a122f030b43d2553"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KvLogStoreReader.next_item: MethodTooLong \u2014 next_item 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":"src/stream/src/common/log_store_impl/kv_log_store/reader.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f88af80a4a40c45a71806345c34d30d687c44ecd05d4c58a2fe082c3eb61dd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpstreamTableExecutor.into_stream: MethodTooLong \u2014 into_stream 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":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/executor.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bf1c231aab10556b14552910287f287637b21cc27b71fd680a939eed958f10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverPartition.find_affected_ranges_readonly: MethodTooLong \u2014 find_affected_ranges_readonly 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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"c039bf201826f08f8381df26b1d99124f8535c4a35f32718963f826e660eae19"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SstableBuilder: 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), 13 methods, 3 blocks, lines 136-800. 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":"src/storage/src/hummock/sstable/builder.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"62285ab953c59a3c80305896003a4391248e2d2eb9d88d59e63e2aa4c08fdb47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/list_array.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":"src/common/src/array/list_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eca41dee4398a11430cf269ccf044b9148f2e04aa297bef206cc30c952ecf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manager/metadata.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), about 73% of them inside a single declaration: MetadataManager (3 blocks, 44-830). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1bf17ae39d2ce4e7c03dff1afbdd1bdd1a480ccc5edb617adc033e39a57d59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compactor/fast_compactor_runner.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":"src/storage/src/hummock/compactor/fast_compactor_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328f9cb6642c0b250fa7ab888401f7b814c4f869a2bd0d6978853f3c1c9f6844"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalScan: ClassTooLong \u2014 468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 12 blocks, lines 51-797. The bar is 400 significant lines; this is 68 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":"src/frontend/src/optimizer/plan_node/logical_scan.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e37bc74dc303d90a2ffe0887fe8fb8c088f5f4f4c8230a7d06ef2adaa92c63a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbzChangeEventConsumer.handleBatch: MethodTooLong \u2014 handleBatch 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzChangeEventConsumer.java"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f106467d2747b4a0264eeb3e65a3e042938e5b37e959e3ed1bf6c54450a34c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlServerSinkWriter.flush: MethodTooLong \u2014 flush 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":"src/connector/src/sink/sqlserver.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1691cca68b4c060c5178cf4075a7932b1ff4af05ea5141434ba17d221e979200"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SstableStore: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 206-854. The bar is 400 significant lines; this is 67 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":"src/storage/src/hummock/sstable_store.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e86e007816837eac35f3a52ad63df4d6e2f56c522217765b8da935a1792ac48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Model: TooManyFields \u2014 35 stored fields beside 1 method. 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":"src/meta/model/src/table.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a0ad782aae66ffda0ade253128eee48ccd974b2ef030e14030415a551535a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pgoutput/PgOutputMessageDecoder.java: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: PgOutputMessageDecoder (80-961). The bar is 500 significant lines; this is 80 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/pgoutput/PgOutputMessageDecoder.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c319b0ecd3361586c07e14784667bf3be03b10356ae301d6902bc6c981d9610"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LookupJoinBase.do_execute: MethodTooLong \u2014 do_execute 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":"src/batch/executors/src/executor/join/lookup_join_base.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbfe7e85f3dcf5eabdfb898c72c4b6796738336d6592ea9bae2687b8c88750f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnifyFirstLastValueRule.apply: MethodTooLong \u2014 apply 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":"src/frontend/src/optimizer/rule/unify_first_last_value_rule.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d179738673d1d7d25190d2ecac33d8f934be783b088c442a749b540a05f70ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckpointControl.handle_new_barrier: MethodTooLong \u2014 handle_new_barrier 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":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4fa7be05b41023637cc3c5865ed9dbc17277cb61b8d8feaef6831f94656b2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UploaderData.sync: MethodTooLong \u2014 sync 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":"src/storage/src/hummock/event_handler/uploader/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1af729ddac718e8071bf935975771f9ad33f780b289ccc650de82d21e4b596"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaterializeCache.handle_inner: MethodTooLong \u2014 handle_inner 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":"src/stream/src/executor/mview/cache.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3027114fba1bd395a5bd937588ad87b486b33bfe137e85d3ddbccf105cd423b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalBarrierWorker: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 3 blocks, lines 303-1120. The bar is 400 significant lines; this is 62 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the 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/stream/src/task/barrier_worker/mod.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d564406b1c2f994c51228139043510dcb5837bf1d68be39f3ec0a4544993a24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlserver/SqlServerStreamingChangeEventSource.java: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: SqlServerStreamingChangeEventSource (85-837). The bar is 500 significant lines; this is 77 over it, 1.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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/sqlserver/SqlServerStreamingChangeEventSource.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f63a30ce1f69d78540dc7be36079eff5f28d86f335b0954161daf053b302f73"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TableCatalog: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 6 blocks, lines 83-912. 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":"src/frontend/src/catalog/table_catalog.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e63ab327dc048c333f10032e47d442356b0c359c0ef18ea021620fc3536758"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SinkMetrics.new: MethodTooLong \u2014 new 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":"src/connector/src/sink/mod.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a516d8bea8aad7d9a252a3b820a316156051ed1aa2c8411c399ef00e4c40e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialGraphManager.next_event_inner: MethodTooLong \u2014 next_event_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":"src/meta/src/barrier/partial_graph.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"380e24001eabd93ca713e0e042a0e5b212d64e45c1686ecf3475c7ff2e8276a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::manager::iceberg_pk_index_sink::coordinator::coalesce_position_delete_files: FunctionTooLong \u2014 risingwave_meta::manager::iceberg_pk_index_sink::coordinator::coalesce_position_delete_files 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":"src/meta/src/manager/iceberg_pk_index_sink/coordinator.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"088913bf933978ef6949324a136c6b5d62bfff7564b478a7d0a08f27a5273f7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogStoreRowOpStream.next_op: MethodTooLong \u2014 next_op 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":"src/stream/src/common/log_store_impl/kv_log_store/serde.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef836eebc35eacf1dea54ad2fafb862473d212619dd58b5f5ee060bfd394650d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchAdbcSnowflakeFetchExecutor.into_stream: MethodTooLong \u2014 into_stream 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":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c866b430cbd9522b35aaad0ee5ccfb9b8e7fec01fddaf5ab36b64923faf0d386"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatabaseCheckpointControl: ClassTooLong \u2014 459 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 4 blocks, lines 753-1403. The bar is 400 significant lines; this is 59 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":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7194323266da1e908a40ea9a3a3d13f93d41efcb8a9df806dfcc3e0ba64e99d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tokenizer: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 315-1033. The bar is 400 significant lines; this is 58 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":"src/sqlparser/src/tokenizer.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2a044cff8d376d876e05d3238d157fab252460d6059e8b6024a00613bc0e94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: monitor/connection.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 71 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/metrics/src/monitor/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87eb8eb089db180265257e67fd75fe14d9cf2fe6db93a4a9295b6ecd5141373f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_common::config::storage::extract_storage_memory_config: FunctionTooLong \u2014 risingwave_common::config::storage::extract_storage_memory_config runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/storage.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"752e1b7352c63c939e76cfcce04059096923a71f6879e52deac1ab1c1760b205"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClickHouseEngine.from_query_engine: MethodTooLong \u2014 from_query_engine runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/clickhouse.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a707753c710545c2233002b10f375b8bf0b0e3a762658fe4dce0fe89a1a09fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubscriptionCursor.create_batch_plan_for_cursor: MethodTooLong \u2014 create_batch_plan_for_cursor runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/session/cursor_manager.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f3f782a6e7f8cbbff6f228699818f44973c3a9551810def3e4b106b50fd697"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergPkIndexSinkCoordinator.pre_commit: MethodTooLong \u2014 pre_commit runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/iceberg_pk_index_sink/coordinator.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"736d15753a3e3af42fa19b29c11e2bd3dab31fea787773a12eb54aa6a6a08ed3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inner.execute: MethodTooLong \u2014 execute runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/project/project_scalar.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac832b2e99968e7fa8957a0d63c5404c8a35621ab15233e704ae492d352b0f47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compaction_group_schedule/topology.rs: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: HummockManager (2 blocks, 44-870). The bar is 500 significant lines; this is 68 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":"src/meta/src/hummock/manager/compaction/compaction_group_schedule/topology.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"246c77e8a4b0839145cd32ba76d9133c2a2c28f5db495191d1238c629bccd502"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalQueryExecution: ClassTooLong \u2014 454 significant 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, 2 blocks, lines 60-695. The bar is 400 significant lines; this is 54 over it, 1.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":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1ca1af668858581ea3f0fd0a19bc61023b140e812a0345ae2495cc581daafd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Panels: 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":"grafana/dashboard/common.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44fe2799c6d53cfe78e21f4ba018e089c46751ad5d1066e68403e357052ccc7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CatalogWriterImpl: ClassTooLong \u2014 453 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 3 blocks, lines 314-888. The bar is 400 significant lines; this is 53 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":"src/frontend/src/catalog/catalog_service.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"75477b341fab7135be991528b4380e445ceae6b30cf45463c5f75c1d8be50e12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/planner.rs: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/iceberg/planner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56583b01dc3e97206d28e536abcd71c3a3c9af6f81df9790ff566259de6c0ec9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::parser::additional_columns::build_additional_column_desc: FunctionTooLong \u2014 risingwave_connector::parser::additional_columns::build_additional_column_desc 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":"src/connector/src/parser/additional_columns.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83c41fdea1d5e418d1da6e1f12381829b5d23ac5ceb95f676b3d855789128f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::parser::unified::debezium::bson_extract_number: FunctionTooLong \u2014 risingwave_connector::parser::unified::debezium::bson_extract_number 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"37590e47409643dd903471ca4af1d3d55dbe5cd875360f71ff302804636aefe6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder.bind_update: MethodTooLong \u2014 bind_update 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":"src/frontend/src/binder/update.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a010fbdc01248e887c2fdf20683c3ba7de93d376a3343dade05c87250bb698"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::catalog::system_catalog::rw_catalog::rw_columns::read_rw_columns_in_schema: FunctionTooLong \u2014 risingwave_frontend::catalog::system_catalog::rw_catalog::rw_columns::read_rw_columns_in_schema 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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb90302e8ee9a86c975b02587d9a21926b1b1b0200463494d96e5c21431ef6a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CorrelatedTopNToVectorSearchRule.apply: MethodTooLong \u2014 apply 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":"src/frontend/src/optimizer/rule/correlated_topn_to_vector_search.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1888e2faad8b0fc5c87b62fff11bd714be26f50fd2e996ceefb1c7eb7dbd7edc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsOfJoinExecutor.new: MethodTooLong \u2014 new 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":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"832173357a76512b22d5f7155a8d4e8bc93e3138eafc9ed316a076f784914fb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_stream::executor::backfill::snapshot_backfill::executor::make_consume_snapshot_stream: FunctionTooLong \u2014 risingwave_stream::executor::backfill::snapshot_backfill::executor::make_consume_snapshot_stream 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":"src/stream/src/executor/backfill/snapshot_backfill/executor.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d46cc48f58c960fb81082e5a541f334e5fd8425908ca5571e239b78af67ee6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverPartition.build_changes: MethodTooLong \u2014 build_changes 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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a18fce3c2712672cf84fa494c9828e8c1f20dcce46c2144067b69df8b37fdd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartitionCache.shrink: MethodTooLong \u2014 shrink 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":"src/stream/src/executor/over_window/range_cache.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2a83c2d43198973ee117c4750bcf8e584aac18fb9321d00598e753fe7bd0a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergListExecutor.into_stream: MethodTooLong \u2014 into_stream 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":"src/stream/src/executor/source/iceberg_list_executor.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b4de3316b69d2386c80dcdf3a82d78141e80a093c47fe69fa9bda056e9e23c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backfill/utils.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":"src/stream/src/executor/backfill/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5db89b1039e8614bd4f2aeaf3b713b12de9f74f7aaaaf439bc9c0c1923d03f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StreamActorManager: ClassTooLong \u2014 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 63-664. The bar is 400 significant lines; this is 50 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":"src/stream/src/task/actor_manager.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fba9cb78329b5f72658530f60c7d0b3979b9c01b511dd98e6304216bdee6098"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MvSelectionRule: ClassTooLong \u2014 448 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 3 blocks, lines 30-651. The bar is 400 significant lines; this is 48 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":"src/frontend/src/optimizer/rule/mv_selection_rule.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f73c79188886734a374cd915ffcf6266e6cea293bbe31d528eacc38c36a397"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: await_tree.AwaitTreeDump: FunctionTooLong \u2014 AwaitTreeDump 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":"dashboard/pages/await_tree.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db913508fbd0a1a34bc8e2f57da518d7b18b2c3214f5e3153e5cea7e120943b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalMultiJoin.as_bushy_tree_join: MethodTooLong \u2014 as_bushy_tree_join runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba8d882a96e3ca018da20ec9aa85d795948b074f1199b026a23917050276df3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.new_impl: MethodTooLong \u2014 new_impl runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfbc1f535c926eccdd261dadbe9071646ed709d8a9a283d419257881b7014d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsonParseOptions: ClassTooLong \u2014 447 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 3 blocks, lines 191-813. 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":"src/connector/src/parser/unified/json.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1650da163bc3fae7f4cae8be6a4e7a86f84ba471b65fefde61fd117db80f14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::stream::stream_graph::fragment::rewrite_stream_scan_and_merge: FunctionTooLong \u2014 risingwave_meta::stream::stream_graph::fragment::rewrite_stream_scan_and_merge 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":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17b8d3960db3631df8f573346bbca43234cd0f08da4492e9c4af99f9eea5817"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashJoinExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor 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":"src/stream/src/from_proto/hash_join.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd3aec7ebe8e58e17988e31bafea5a019bc36538141b606797f52ae8f8ea3a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/edge_builder.rs: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: FragmentEdgeBuilder (3 blocks, 284-774). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/edge_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0b1967a8bfc5adb4de8540c24acd43b4ed2c23e8129f18f68b95bb3843421a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/logical_multi_join.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), about 78% of them inside a single declaration: LogicalMultiJoin (11 blocks, 50-878). The bar is 500 significant lines; this is 52 over it, 1.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":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6d14c26dcbbe39d955aa7c7d1f4c49d21005c5dec20e6422d42dafedaa9554"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hummock/utils.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":"src/storage/src/hummock/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbe41060aab7835a7783428bfeaa93477f0a005b89f7e6e9bf13863683bcc77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/stream_materialize.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), about 94% of them inside a single declaration: StreamMaterialize (5 blocks, 53-753). The bar is 500 significant lines; this is 51 over it, 1.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":"src/frontend/src/optimizer/plan_node/stream_materialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"709ffe8160b6f4f2371b6409b430cbeb3250f99f1efc6ec33e99245da7fe281b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BinlogOffsetContext: 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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/binlog/BinlogOffsetContext.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c76a9f1cec793aa280b4ab2058f137dd073b20f25d58ecaf58b4ebba21a317"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FrontendEnv: 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":"src/frontend/src/session.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e632a7f8f77776aa7eb61e7055de7d6033f38c6a989ee3dc454976fc284c068e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/hash_agg.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84e37192dc05d2f952fc5ca5c230ff61243e154d603dd87249b72c34fc11877"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TimeControls.TimeControls: FunctionTooLong \u2014 TimeControls 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":"dashboard/components/TimeControls.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"953ed6135eddfd9f0628065424c755e659d1fd70773863d3fff69f0e459f3ed0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_common::vnode_mapping::vnode_placement::place_vnode: FunctionTooLong \u2014 risingwave_common::vnode_mapping::vnode_placement::place_vnode runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/vnode_mapping/vnode_placement.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8fe115f9815d9e75ada93e7c4c22c6200f9f4071c95a3f795a39fea7fcc5af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::sink::encoder::proto::on_field: FunctionTooLong \u2014 risingwave_connector::sink::encoder::proto::on_field runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/encoder/proto.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b3e1096bcc525df0148547657eb0c233ecc412e2f66f7d8d4bd3fb456d65d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseCheckpointControl.next_complete_barrier_task: MethodTooLong \u2014 next_complete_barrier_task runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c1cb630a22ed7369aaf6adc990224458642805becb985b4e6efdf8a80de699"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CreatingStreamingJobControl.recover: MethodTooLong \u2014 recover runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/creating_job/mod.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"846d6fac05c842a06cdb7c8f372a9737e6c96be8bc8557d7903ca4067f9a4b57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::hummock::manager::compaction::compaction_group_manager::update_compaction_config: FunctionTooLong \u2014 risingwave_meta::hummock::manager::compaction::compaction_group_manager::update_compaction_config runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/manager/compaction/compaction_group_manager.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"02657528f7cfe6c466f44d589b250a5a7bfc7d425b96a76447459592ea2396c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalStreamManager.create_streaming_job: MethodTooLong \u2014 create_streaming_job runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91fd46c0250bfa513c5ffcd8ebd10509bc5f07ee34725a8d0eacb8c0100477d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_show: MethodTooLong \u2014 parse_show runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":5244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f969d8f94732b1d13ae37601d7e96fb4a47630af4eefede9ed3874d0997be36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_storage::hummock::compactor::compactor_runner::compact_and_build_sst: FunctionTooLong \u2014 risingwave_storage::hummock::compactor::compactor_runner::compact_and_build_sst runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compactor_runner.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d729caa7a52bf16e7f3382ab2515d9bc07929bf170cce9aebe13634fc84af33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MetaNodeOpts: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/node/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b7b8d1de4e24360a5a617ceed1bbf68f8c2abe6f04a25fcea9db52e19b4f42"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrangementBackfillExecutor: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 48-813. The bar is 400 significant lines; this is 39 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/arrangement_backfill.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"52032ff301307c221ffb96b3fd865542fd1d03b10db1fa5da3803d925d04f1ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/remote.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfabe0d03b0905fb01a705ebaf8a09da0b9ad46e972aab4ce470db14bd2fc41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/table_watermark.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/table_watermark.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9acd819e8bae274705b559434b3fd013634cd942e2d4b803ac68c8d3d0ab10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prost/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3061104b159869df7209116f5074dfbc4943f1ee31d2cb9eca916d0fb7b19870"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controller/user.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: CatalogController (50-744). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/user.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adb4d2bad2667798a535faf31bd2863022738166b455fb68913850451e8566f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: over_window/general.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: OverWindowExecutor (3 blocks, 52-815). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/general.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d451458382345572f09150075bfe6f3a9665140b8172a4c8d89a78ac90a27d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::sink::iceberg::metadata::scan_iceberg_metadata: FunctionTooLong \u2014 risingwave_connector::sink::iceberg::metadata::scan_iceberg_metadata 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":"src/connector/src/sink/iceberg/metadata.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a06592b26ad2777c98211fe9b8dd05327d8abc0ccbd75e611cd306dd7ccd53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalBarrierWorkerContextImpl.load_batch_refresh_trigger_context_impl: MethodTooLong \u2014 load_batch_refresh_trigger_context_impl 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":"src/meta/src/barrier/context/context_impl.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"40daf4d6753b196f7c3273206bbb8dc5663541038f8da338b58af8d304bebe0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_create_table: MethodTooLong \u2014 parse_create_table 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":"src/sqlparser/src/parser.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c51dde40e26dca6ac1f67c8cbba44ebaf6af24455bf50c7d0def27ff837ef67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaterializeExecutor.new: MethodTooLong \u2014 new 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":"src/stream/src/executor/mview/materialize.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afd0477bb6496c808819c579ef1ab2f98630b02d0deb69b490825948609c131"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamReaderBuilder.into_retry_stream: MethodTooLong \u2014 into_retry_stream 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":"src/stream/src/executor/source/reader_stream.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac11de3793943c3d34673c20d3eda40c5bf59cd622649f8094ec861ea8600ec3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/deltalake.rs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/deltalake.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af51e641ed712de24139a47c0b9571520af7c92ad1278795b0e5de75ff7d6b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Decimal: ClassTooLong \u2014 435 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 21 blocks, lines 36-827. The bar is 400 significant lines; this is 35 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the 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/common/src/types/decimal.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb82b71771ae3fdb3fa4d5dccabd844c2f2fad67e2962f0d5507b9349dd96ae6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalityProviderExecutor: ClassTooLong \u2014 435 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 4 blocks, lines 164-891. The bar is 400 significant lines; this is 35 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the 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/stream/src/executor/locality_provider.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1237420a7389e9f2ea6df10c93b62ea6b8d255216a9a5db70fb4f84b27d8998b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/ordered_float.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/types/ordered_float.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8353c2ec01d05b36ccb9a90974f5795105d465896270a566ca2dfd554d1624e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RedshiftSinkCommitter.commit_schema_change: MethodTooLong \u2014 commit_schema_change 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":"src/connector/src/sink/snowflake_redshift/redshift.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5a646aee8bb990a3254627170e2a06a764a4c8699e6f0596f40888a97ae61e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::catalog::purify::try_purify_table_source_create_sql_ast: FunctionTooLong \u2014 risingwave_frontend::catalog::purify::try_purify_table_source_create_sql_ast 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":"src/frontend/src/catalog/purify.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c731d0b3fc2f708e6ab021a15bda0047c5109f18f67e6197b91e0a013ca607"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Planner.plan_iceberg_log_store_scan: MethodTooLong \u2014 plan_iceberg_log_store_scan 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":"src/frontend/src/planner/relation.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f55625ca0be32a95abefd0b3c008377398b06d6e65f62d4ba8aef72476f6377"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StageRunner.convert_plan_node: MethodTooLong \u2014 convert_plan_node 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":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9097d57f2e4fe7451f54ad9623ac8c8ee391e84ecc8da875a902ab01aeac7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamServiceImpl.alter_connector_props: MethodTooLong \u2014 alter_connector_props 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":"src/meta/service/src/stream_service.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fa65e2fc8f63e39e2a17cb0567c05e9e2a0e078be3e2f562ba798294d5d4ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchIcebergListExecutor.into_stream: MethodTooLong \u2014 into_stream 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":"src/stream/src/executor/source/batch_source/batch_iceberg_list.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90cbfba6dd764b83c0051b764353831431ea36e259bcdb1680c32fcd99d97cb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalMultiJoin: 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), 11 methods, 11 blocks, lines 50-878. 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":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"092eb5054b1696335b2b47b0b863c0401e890f29d9d6d775e2a5ed64ee3ea23e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: election/sql.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/election/sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"347f33992ab9b82658385176df3a2c1d97ed7934e83438239461fcb59ac8dfb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sstable/block.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57c38a6816b8dcfaaecaa79c0e766ad6601b56d363375d2735cc03a4d2a6489"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetadataManager: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 56 methods, 3 blocks, lines 44-830. The bar is 400 significant lines; this is 29 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":"src/meta/src/manager/metadata.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80fe7fc740caf4ca4c982a9c7981f6b516ddbe2c1007268dc0d1ab15918a662"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalHummockStorage: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 7 blocks, lines 63-807. The bar is 400 significant lines; this is 29 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":"src/storage/src/hummock/store/local_hummock_storage.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4083824c3a2ef477b6bca93852ea72c3d401121880012c8527ef7928b6ae76aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CdcSplitReader.new: MethodTooLong \u2014 new 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":"src/connector/src/source/cdc/source/reader.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8601ad27b832d21caea4c07d96728b1c07d09c96aa13e6e51f71f530b4670710"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::source::datagen::source::reader::generator_from_data_type: FunctionTooLong \u2014 risingwave_connector::source::datagen::source::reader::generator_from_data_type 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":"src/connector/src/source/datagen/source/reader.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d18cbaa7eddd30047ff43198854f8236832b1eed27f426d0cec531af6a2608"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalUnion.logical_rewrite_for_stream: MethodTooLong \u2014 logical_rewrite_for_stream 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":"src/frontend/src/optimizer/plan_node/logical_union.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1021feed63286e5372a926e347d449ffca5f95700730e5e65c9637ca23d6f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlController.generate_streaming_job: MethodTooLong \u2014 generate_streaming_job 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":"src/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c99b005b48453b879aff825938bbd1e9e4b15188dcf2b3d442d4dd19a1f2e9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SstableBuilder.add_impl: MethodTooLong \u2014 add_impl 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":"src/storage/src/hummock/sstable/builder.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cedaffb8452997e79d3f53fcdc26bba3b10b15e786048da1b2f850719b1168"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iceberg/config.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: IcebergConfig (3 blocks, 297-855). The bar is 500 significant lines; this is 34 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":"src/connector/src/sink/iceberg/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b443bdb9748228c72891d93df4f7a00e7af6f03d69c5df73171d28a509aef18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/create_index.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaf5366f69cbf94f8cc72ab1e4ff619bf60aebcdff7885b243e44eada421602"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"708d57ccdfcac1ccfc929f3ab05c4cd9fe468ebf7a32c8b3e60eec45a8703d44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StreamChunk: TooManyMethods \u2014 32 methods, declared across 2 files: array/stream_chunk.rs (27), array/stream_chunk_iter.rs (5). The bar is 30 methods; this is 2 over it, 1.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":"src/common/src/array/stream_chunk.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6811349abc648a35b74be49c9a3890cfa6800c87ee1a8932f850cac5ea21ef0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: risingwave_common::config::meta::default::compaction_config: 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":"src/common/src/config/meta.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"2963160c3b469dd19c1c20b8232eae022b2e7958c13592c396792825724c4162"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataType: TooManyMethods \u2014 32 methods, declared across 4 files: types/mod.rs (25), types/postgres_type.rs (5), types/list_type.rs (1), utils/data_type.rs (1). The bar is 30 methods; this is 2 over it, 1.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":"src/common/src/types/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"955b419ebe65a005f9af332cc3dd963ac209b81997e2d8731d35da7a700cadef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: risingwave_expr_impl::scalar::cmp: 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":"src/expr/impl/src/scalar/cmp.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb84d87552371a1bad949276e7ddb447f2ebdea769cdad12e2b922235104d13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/gap_fill.rs: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: GapFillExecutor (4 blocks, 160-814). The bar is 500 significant lines; this is 33 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":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99155c3b7d27b4403394242597e8877a1cdd3d07de8613385816b5785c67d94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: relation/table_or_source.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: Binder (91-739). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f29c9d114b8b7244bbcfd0da11228cf61e5322dd03848f542a57deeda4c7c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pg_message.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a214990e536ff945c5cc59c9706f297b38dc156201d9e418e39f71c43ced9a48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/table_catalog.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: TableCatalog (6 blocks, 83-912). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/table_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e635ed04169aaba469c255d801e90ec587909b3d2676b576fe04bae186ba63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DistributedLookupJoinExecutorBuilder.new_boxed_executor: MethodTooLong \u2014 new_boxed_executor 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/batch/executors/src/executor/join/distributed_lookup_join.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16b77e1c47c9391059d33392f7f5a2050111265904095c12312888a92eb42ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionTimezone.with_timezone: MethodTooLong \u2014 with_timezone 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/frontend/src/expr/session_timezone.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a7c04087b237cb72404fe40768e8b4d2345c46f30390fd69826f1b11306c70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalJoin.logical_rewrite_for_stream: MethodTooLong \u2014 logical_rewrite_for_stream 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/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"30de72843a428b9c71d06d133bd93be223ec5e6dedde1838253aff5a625080c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamMatchRecognize.try_to_stream_prost_body: MethodTooLong \u2014 try_to_stream_prost_body 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/frontend/src/optimizer/plan_node/stream_match_recognize.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"141e80c1102abf70146d5c75a901adf4e544ea5e115ee018fc0371a74743d043"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::barrier::context::recovery::render_runtime_info: FunctionTooLong \u2014 risingwave_meta::barrier::context::recovery::render_runtime_info 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/meta/src/barrier/context/recovery.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"573c6e05ecd67010061b73f8a5ef1c184763cba83b52d12b47007d3bffeabf0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnsembleActorTemplate.render_new: MethodTooLong \u2014 render_new 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/meta/src/controller/scale.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"701ac9dea0ebccc179d804872ea9d0d3c1cb6f3a13a7b08dfbaead1d27ac09f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SstableStore.prefetch_blocks: MethodTooLong \u2014 prefetch_blocks 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/storage/src/hummock/sstable_store.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a227202b6bb7a147ff9c6ec230a45480283d800eaa45d345b23f0baa46b2b49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NestedLoopTemporalJoinExecutor.into_stream: MethodTooLong \u2014 into_stream 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/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0762f2555e003e12085e0488bada3bf2fa81e19c33290d94059c0878a035029"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GapFillExecutor: ClassTooLong \u2014 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), 6 methods, 4 blocks, lines 160-814. The bar is 400 significant lines; this is 23 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the 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/stream/src/executor/gap_fill.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"205b4aec22c77c0cbf5a0253f6dfd143734d99f81363f47314947f3e1ea731e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChangeEventSourceCoordinator: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 22 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/pipeline/ChangeEventSourceCoordinator.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a145519098e5a386746ec1ff142546972da808606deb9a67d7d8a03acaf436f1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DebeziumSplitEnumerator: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 14 blocks, lines 52-668. The bar is 400 significant lines; this is 22 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the 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/connector/src/source/cdc/enumerator/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf12e0ae41ce317227c0b79522410b0392c58fee8c79ffff475260c940627dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compactor/compaction_utils.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compaction_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316b5cc75ee2af5a24d0b9d6f2d5dd8425ee5819f7bbee93a69434768c30c14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hummock_service.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), about 94% of them inside a single declaration: HummockServiceImpl (3 blocks, 42-722). The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/hummock_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f321513b72404a359e88674739f0222a981e1af86a182f1c7891e4578ffd2cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_source::bind_source_pk: FunctionTooLong \u2014 risingwave_frontend::handler::create_source::bind_source_pk 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":"src/frontend/src/handler/create_source.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c458efacbe688750975bf3a49f42b498f3c1927af7dfd8da89125c16123eb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::create_sql_function::handle_create_sql_function: FunctionTooLong \u2014 risingwave_frontend::handler::create_sql_function::handle_create_sql_function 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":"src/frontend/src/handler/create_sql_function.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3c53133c8392aeac2677860faa2225fc0d4e9d106013f7244db60a75908028"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FragmentActorBuilder.rewrite_inner: MethodTooLong \u2014 rewrite_inner 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":"src/meta/src/stream/stream_graph/actor.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8600abee655140b7ca2feb59f52009deec34eaff9c228fd40aba72dd19f978"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockReadVersion.update: MethodTooLong \u2014 update 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":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9f7f75a825fe9e5a69cc277f56c89c0df7389ff51f17fd90ebe46195b1d69a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchIcebergFetchExecutor.into_stream: MethodTooLong \u2014 into_stream 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":"src/stream/src/executor/source/batch_source/batch_iceberg_fetch.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"44714a84a5d1333a9051f38c1c04d93026ad37ae0866379f8b880e50f1c0c8d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compaction/compaction_event_loop.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":"src/meta/src/hummock/manager/compaction/compaction_event_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc54617f102089442d64ebe8b67f4a44808c8e5023a620e8593e84dee108d0ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/data_chunk.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: DataChunk (6 blocks, 65-918). The bar is 500 significant lines; this is 22 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":"src/common/src/array/data_chunk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9906ead2f9f4f26bbcf0bae079b97489f9957b2a4163a8b8e4916407da5519e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/decimal.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Decimal (21 blocks, 36-827). The bar is 500 significant lines; this is 21 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":"src/common/src/types/decimal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25bb0150d6e718e9f819079764a23c5963d3b422aafed45a3d3cb95aa2db69f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manager/mod.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: HummockManager (2 blocks, 154-671). The bar is 500 significant lines; this is 21 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":"src/meta/src/hummock/manager/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e3de68aa12bc762a6b59b8b15577831b8a61ab872d9b806a17cd3db99ccc33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/locality_provider.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: LocalityProviderExecutor (4 blocks, 164-891). The bar is 500 significant lines; this is 21 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":"src/stream/src/executor/locality_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e6510839a4b966c682ceff21e5b99d075c74618f406787bb87a0355d211eaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetaOpts.test: MethodTooLong \u2014 test 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":"src/meta/src/manager/env.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bed9d50b8f25a05b7c6f3d8ec368cef5d33a10417fda0806d32e250ae32123"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_meta::serving::start_serving_vnode_mapping_worker: FunctionTooLong \u2014 risingwave_meta::serving::start_serving_vnode_mapping_worker 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":"src/meta/src/serving/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"070532f2bb4970250bac3d9b9b3be777df276a0cdf5c01a13ffbe44fd83606db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchRecognizeExecutor.emit_ready: MethodTooLong \u2014 emit_ready 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":"src/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eb1f8111596355c0057e471c68464d4495e45853275473a60b4a98c2c8dee4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/refresh_manager.rs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: GlobalRefreshManager (2 blocks, 94-565). The bar is 500 significant lines; this is 17 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":"src/meta/src/stream/refresh_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df45aed51648ea63eee1b7dc535729424ea775cd3fe5b5a50d334f55b0e9e17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IcebergCompactionManager: TooManyMethods \u2014 31 methods, declared across 5 files: iceberg_compaction/schedule.rs (16), iceberg_compaction/mod.rs (6), iceberg_compaction/gc.rs (4), iceberg_compaction/stream.rs (3), \u002B1 more file(s). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/iceberg_compaction/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c855e3c874cff2bf7f7988c7ddbdf666e6776797b0f83d0d5fd5dbd0df20d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BatchTableInner: 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":"src/storage/src/table/batch_table/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d19fb3b129706fdabc844a0b67a0920bcc57db666b7a3e80fda1dbad2a47b4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Agg: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 6 blocks, lines 54-745. The bar is 400 significant lines; this is 12 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/agg.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1f30560df8b17e9bd32b6e538e3a63d0a6493b2867b63d89267d51b8e5bb19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sink/lancedb.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/connector/src/sink/lancedb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0b89a0513fa79d12d8aff5937c6102b990250803d3a179cce8ab3a802aa63e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector::parser::mysql::mysql_datum_to_rw_datum: FunctionTooLong \u2014 risingwave_connector::parser::mysql::mysql_datum_to_rw_datum 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":"src/connector/src/parser/mysql.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f621a917b22329abb3cd57bd0ac8fbd2e446161ad3c6874c5788654ad4247d3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IcebergSinkWriterInner.build_append_only: MethodTooLong \u2014 build_append_only 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":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3556a867a17fc8eba6c3ac4a93603daac9c05c3f1c38e884df763ee156e4d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Condition.analyze_group: MethodTooLong \u2014 analyze_group 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":"src/frontend/src/utils/condition.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4bade4882f558a18d66008574fe7f63169216bd45825ab181ce69482598c54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactorRunner.new: MethodTooLong \u2014 new 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":"src/storage/src/hummock/compactor/fast_compactor_runner.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b454560304944cc30056666dc4cae7ee8b150197a162696a1e783305a135094b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_stream::executor::temporal_join::phase1::handle_chunk: FunctionTooLong \u2014 risingwave_stream::executor::temporal_join::phase1::handle_chunk 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":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9aa3293534e9f5a4240c2033a7a6b402d376f940dfbc7eeb9ad5b79149bbe8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResultCache.consume: MethodTooLong \u2014 consume 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":"src/utils/pgwire/src/pg_extended.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0572ba272a7f7e5705cf6bce4b0071ad9436a7e77c58534e2a052df9d2b5a0c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/logical_over_window.rs: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: LogicalOverWindow (7 blocks, 237-768). 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":"src/frontend/src/optimizer/plan_node/logical_over_window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a5c15701bd5961dcc8f8bb7b33d356fd4ac730761937ada2958ae02573b56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/actor_manager.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: StreamActorManager (2 blocks, 63-664). The bar is 500 significant lines; this is 11 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":"src/stream/src/task/actor_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ba527f1b91dae9c6ef7a4d0012d7a5075170d4348cb926358cc7e9e3a526b3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TopNCache: ClassTooLong \u2014 408 significant 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, 8 blocks, lines 51-822. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/top_n_cache.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"20757cfc0444eeac1cd5027a9b9ded109c7ae7f4089147e237f462a1c06dcf78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/PostgresValidator.java: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PostgresValidator (31-762). 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d437d0446cacbf1c3fd5fbd260405f511886cdc5f3afd1228f3115b32df9173"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_connector_codec::decoder::protobuf::parser::from_protobuf_value: FunctionTooLong \u2014 risingwave_connector_codec::decoder::protobuf::parser::from_protobuf_value 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":"src/connector/codec/src/decoder/protobuf/parser.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23d51ac7bf5d06b01d116ae147e8941f028b38858f5c87fcb6ad031709941a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatsWindow.new: MethodTooLong \u2014 new 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":"src/connector/src/source/kafka/stats.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4dc859251b228e6f6224da857fc7ea23dca1b4f199a3ec3e4f0633cf3e472a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchRefreshJobCheckpointControl.start_refresh_run: MethodTooLong \u2014 start_refresh_run runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d792022210600a14d9840202d933acb84ac79e04ca050d323a91ac3786bbff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: relation/mod.rs: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Binder (290-741). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"456d42bfb3f8911e91ea96d8ad2bb9c8e61d8b6019bcdde5b0a479c0ab5a606a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StreamFragmentGraph: 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), 23 methods, 2 blocks, lines 909-1593. 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":"src/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76d95aa98d52dad8282718d48334370e2b6ab4e13e9fe843992ce0e442b19e2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HummockStorage: 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), 16 methods, 7 blocks, lines 96-1099. 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":"src/storage/src/hummock/store/hummock_storage.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d52adcbe0766002507016006f9fbedb6573e7530d5dd4d181282a5c4136e842"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TableFunction: 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), 12 methods, 4 blocks, lines 44-640. 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":"src/frontend/src/expr/table_function.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8de21f7f83964ae89d1eeafa6162f5796b38414cc52ff5655d79c539870b14b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KafkaSplitReader.new: MethodTooLong \u2014 new 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":"src/connector/src/source/kafka/source/reader.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"12499205dcafc9cdccbb620f8f1a8c9ba13bfb97a8dfb8e8e866808f54b62542"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: risingwave_frontend::handler::alter_user::alter_prost_user_info: FunctionTooLong \u2014 risingwave_frontend::handler::alter_user::alter_prost_user_info 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":"src/frontend/src/handler/alter_user.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2492653f88f72f271d6262e1346022f6cf93cebfbf3ddbfe861b157f00e8918a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ControlStreamManager.inject_barrier: MethodTooLong \u2014 inject_barrier 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":"src/meta/src/barrier/rpc.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01133236097c62a1ada42eb1f2e70e5cfb92376c1f1e798b8bd6e0c3f3b6008"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HummockManager.apply_normalize_plan: MethodTooLong \u2014 apply_normalize_plan 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":"src/meta/src/hummock/manager/compaction/compaction_group_schedule/normalize.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ed34f30e5ca62d0244e57024a8052c422ada4f480f5fb570ac28d6a369e76a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialGraphState.poll_next_event: MethodTooLong \u2014 poll_next_event 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":"src/stream/src/task/barrier_worker/managed_state.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3e031a0f8ed14cf78fab445683034f13a1a11e068c8635c2edb9c9b3f6ab01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binder/select.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: Binder (201-704). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c01dd8f6cdc5553b78f6c259f0f6029375eadfa776fdfd22e26e5da3c83da6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PartialGraphState: ClassTooLong \u2014 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 5 blocks, lines 623-1210. The bar is 400 significant lines; this is 3 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":"src/stream/src/task/barrier_worker/managed_state.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cef2778ad1c2b7c7318d7d8bdcd32db96f8e356777c323f811be6a37d34148"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalAggBuilder: ClassTooLong \u2014 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 3 blocks, lines 493-1075. The bar is 400 significant lines; this is 3 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":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"903ccc065e1fb8c56fc6999803c3650c85669e96c7349e05d03885d6075806b9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CheckpointControl: ClassTooLong \u2014 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), 21 methods, 3 blocks, lines 96-682. The bar is 400 significant lines; this is 2 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":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a70c877bb4b72f0141d3f18028b3f40b520b7cdfc2f5fc53960564ad59e03c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_node/logical_scan.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: LogicalScan (12 blocks, 51-797). The bar is 500 significant lines; this is 2 over it, 1.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":"src/frontend/src/optimizer/plan_node/logical_scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"297b84b3cd80c6d66aed8edc6f50afd9476f03723efaf9a4ac806cdaa95444df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IndexSelectionRule: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 3 blocks, lines 92-1010. The bar is 400 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/index_selection_rule.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef4f21664d357cd7d922e178a1d317d14591962ac2513d5b592864e3e08a7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 15 shared lines): src/frontend/src/handler/alter_rename.rs:76-101 | src/frontend/src/handler/alter_rename.rs:107-130 | src/frontend/src/handler/alter_rename.rs:136-160 | src/frontend/src/handler/alter_rename.rs:166-191 \u2014 These 4 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_rename.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"67344520e7dad0ef52bc227bf8cbdb5e2b3196d775536bc986ab0d1f5767a841"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 29 shared lines): src/storage/src/mem_table.rs:150-202 | src/storage/src/mem_table.rs:204-283 | src/storage/src/mem_table.rs:290-370 \u2014 These 3 members are variants of one another: a block of 29 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":"src/storage/src/mem_table.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4581408dfd028de7fa34638253f31a0fd41e697f615e6aa087f91960d6e510a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 13 shared lines): src/frontend/src/handler/create_aggregate.rs:35-159 | src/frontend/src/handler/create_function.rs:52-216 | src/frontend/src/handler/create_sql_function.rs:34-186 \u2014 These 3 members are variants of one another: a block of 13 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":"src/frontend/src/handler/create_aggregate.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cdc85ea6ff47085cea2909b3d6d85267ca7741fe6a8ea3c2cca440c10e5947"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 10 shared lines): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:217-292 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:302-418 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:428-602 \u2014 These 3 members are variants of one another: a block of 10 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4467b4b538c0135ebd13e98dc3f9edb0284807ea4a788fd6c6f53436c633e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (149 shared lines): src/stream/src/executor/asof_join.rs:323-505 | src/stream/src/executor/hash_join.rs:584-776 \u2014 These two members are variants of one another: 149 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":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0125cfc7005143229f20bb649b2252fc922d67d03b718191a2f17e28276f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (101 shared lines): src/stream/src/executor/nested_loop_temporal_join.rs:150-293 | src/stream/src/executor/temporal_join.rs:666-877 \u2014 These two members are variants of one another: 101 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":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9342cfc59fd63c21b81f5d1171bb4f7275e76a3023393ab59b929bdffaace43"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (85 shared lines): src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:293-388 | src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:861-976 \u2014 These two members are variants of one another: 85 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":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a92717b1271391c5b19db3788015918d91f905adf408723b86bc442357a739"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (71 shared lines): src/connector/src/sink/iceberg/writer.rs:330-449 | src/connector/src/sink/iceberg/writer.rs:456-663 \u2014 These two members are variants of one another: 71 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":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce758662ff7fdba2e9f93ae24949ab8fb3b9dc5aa49acee672571533343d6db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): src/stream/src/executor/eowc/eowc_gap_fill.rs:92-266 | src/stream/src/executor/gap_fill.rs:279-471 \u2014 These two members are variants of one another: 67 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":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7179e9eb177c9f4d8ee2c1ecc179c518e040c76ae6ca2c7fa4af03cb1eadc461"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): src/stream/src/common/table/state_table.rs:1956-2036 | src/stream/src/common/table/state_table.rs:2044-2125 \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":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"737ffed4d531c4940db0baa9b6185caf5633c01d0cd5308ce6ceb05129253559"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): src/frontend/src/metrics_reader.rs:51-188 | src/meta/src/dashboard/mod.rs:781-972 \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":"src/frontend/src/metrics_reader.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1b13d08a2a2b71dd4c5dcb492c5e4f7cbe782b554ca5e78a3f100555804c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs:64-128 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs:63-121 \u2014 These two members are variants of one another: 40 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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe954a215eac00c37d574a3386a2f96cdf5c434e2cba98b189646da179b0cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs:75-232 | src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:186-370 \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":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e138a7ff247444ec3d65635b9a9016a45dbf73429ee13dc972ba88045d0c6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): src/stream/src/executor/top_n/group_top_n.rs:175-245 | src/stream/src/executor/top_n/group_top_n_appendonly.rs:156-215 \u2014 These two members are variants of one another: 32 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":"src/stream/src/executor/top_n/group_top_n.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf212854fee6837b929a7578b7518a12acf64750af5b21c98c78192213693522"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (28 shared lines): src/frontend/src/optimizer/plan_node/generic/join.rs:219-277 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:341-444 \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":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd10a73b836e30e840abb0483b1db51def06df1d9a4c3829f9d66984f3fe7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): src/meta/src/controller/streaming_job.rs:3097-3156 | src/meta/src/controller/streaming_job.rs:3165-3277 \u2014 These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":3097}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f89d2590e1ac63c598e4e209de984d942d80eded948c9d04d4334464ee874b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): src/sqlparser/src/parser.rs:3543-3626 | src/sqlparser/src/parser.rs:3747-3853 \u2014 These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b15f94d34c40a819f76bc6f175c68752466a408ff45ba7437c822ace553500"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/frontend/src/optimizer/rule/min_max_on_index_rule.rs:89-133 | src/frontend/src/optimizer/rule/min_max_on_index_rule.rs:140-202 \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":"src/frontend/src/optimizer/rule/min_max_on_index_rule.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"260c31c3098d2ff8cadee25f204f53663c827951b2a67f049b2e7e61bdae3c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/batch/executors/src/executor/aggregation/orderby.rs:128-147 | src/frontend/src/datafusion/aggregate/orderby.rs:129-148 \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":"src/batch/executors/src/executor/aggregation/orderby.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc4d996aaf130726cace01b3bdcb99d0b31b41d2c5c107d345185c46a7683ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/stream/src/executor/dynamic_filter.rs:94-211 | src/stream/src/executor/filter.rs:61-154 \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":"src/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eda831a47d58d311231284c1364cc37059e2a7bb3bf9e71d7c814456371ebbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/frontend/src/optimizer/plan_node/batch_delete.rs:61-79 | src/frontend/src/optimizer/plan_node/batch_insert.rs:73-91 \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/frontend/src/optimizer/plan_node/batch_delete.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4e518ad3269b46f8a72b5fd483f2f12470c55801d1cfa0e9dbe7d674d8ef6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/batch/executors/src/executor/join/hash_join.rs:2472-2513 | src/batch/executors/src/executor/join/nested_loop_join.rs:206-238 \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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb48fc036fd0d890de31bc99ca7e634c53932a9053b8d54680df8c8bbfc0dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/connector/src/connector_common/iceberg/mod.rs:656-715 | src/connector/src/connector_common/iceberg/mod.rs:717-763 \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/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5364038ac697220989d20d805aeb3e9908e03a620d1113d1d3006e67d29d1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/batch/executors/src/executor/hash_agg.rs:332-356 | src/batch/executors/src/executor/join/hash_join.rs:286-308 \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/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc094fd4ae09206c16a4bbdd0ba6ce6a768acecfc6437c70eb583975ad8a256"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): src/connector/src/sink/big_query.rs:279-292 | src/connector/src/sink/clickhouse.rs:380-393 | src/connector/src/sink/doris.rs:113-126 | src/connector/src/sink/file_sink/azblob.rs:110-123 | src/connector/src/sink/file_sink/fs.rs:80-92 | src/connector/src/sink/file_sink/gcs.rs:96-108 | src/connector/src/sink/file_sink/s3.rs:140-152 | src/connector/src/sink/file_sink/webhdfs.rs:84-97 | src/connector/src/sink/mongodb.rs:166-179 | src/connector/src/sink/postgres.rs:151-164 | src/connector/src/sink/snowflake_redshift/snowflake.rs:230-352 | src/connector/src/sink/sqlserver.rs:83-96 | src/connector/src/sink/starrocks.rs:156-179 \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/connector/src/sink/big_query.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04c81dcdf7ba6c48f754dfaacd9e9abf767a7e6967af17acbfc59f0834add33"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): src/batch/executors/src/executor/hash_agg.rs:383-396 | src/batch/executors/src/executor/hash_agg.rs:398-420 | src/batch/executors/src/executor/hash_agg.rs:422-454 | src/batch/executors/src/executor/join/hash_join.rs:341-363 | src/batch/executors/src/executor/join/hash_join.rs:369-391 | src/batch/executors/src/executor/join/hash_join.rs:393-425 | src/batch/executors/src/executor/order_by.rs:380-396 | src/batch/executors/src/executor/order_by.rs:398-416 \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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdeaaa0768ab29f539ef51257e954830439c7f267a3ab3dcd6940a03687f929"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs:91-201 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:74-226 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:163-271 | src/stream/src/executor/source/batch_source/batch_posix_fs_list.rs:207-311 | src/stream/src/executor/source/fs_list_executor.rs:105-173 | src/stream/src/executor/source/iceberg_list_executor.rs:92-259 \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":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f35f6d97ea623c89fcc8ed3124700ad2aa282749ad0bae6bc73df951d189cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/frontend/src/catalog/system_catalog/rw_catalog/rw_connections.rs:37-81 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_functions.rs:41-72 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_materialized_views.rs:43-75 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_secrets.rs:33-56 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_tables.rs:40-70 \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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_connections.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61885d20114463aff0d644e5321b045f2a2f3567f73a4ef77793159354cd879"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/frontend/src/catalog/system_catalog/rw_catalog/rw_internal_tables.rs:39-68 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_sinks.rs:52-116 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_sources.rs:54-120 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_subscriptions.rs:40-74 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_views.rs:36-60 \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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_internal_tables.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcca738795407ea38abf2b86a729dd67e4346ae05ff2096e8b4d12212c99101c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/frontend/src/optimizer/plan_node/batch_hash_join.rs:105-123 | src/frontend/src/optimizer/plan_node/batch_lookup_join.rs:129-157 | src/frontend/src/optimizer/plan_node/stream_asof_join.rs:202-237 | src/frontend/src/optimizer/plan_node/stream_delta_join.rs:109-129 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:515-590 \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":"src/frontend/src/optimizer/plan_node/batch_hash_join.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfd48f88a0ce651f73be5bddfef30a2320ae616ccccd7493ed7a967e1d38326"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/frontend/src/optimizer/plan_node/generic/file_scan.rs:110-119 | src/frontend/src/optimizer/plan_node/generic/file_scan.rs:157-166 | src/frontend/src/optimizer/plan_node/generic/file_scan.rs:170-179 | src/frontend/src/optimizer/plan_node/generic/mysql_query.rs:57-66 | src/frontend/src/optimizer/plan_node/generic/postgres_query.rs:59-68 \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":"src/frontend/src/optimizer/plan_node/generic/file_scan.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba37a916bc14229b1ef410d0e5c0196d6e4dd22c7928a30df00264225bffce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/frontend/src/optimizer/plan_node/stream_dml.rs:35-62 | src/frontend/src/optimizer/plan_node/stream_exchange.rs:109-127 | src/frontend/src/optimizer/plan_node/stream_iceberg_with_pk_index_position_delete_merger.rs:44-66 | src/frontend/src/optimizer/plan_node/stream_sink.rs:188-240 | src/frontend/src/optimizer/plan_node/stream_sync_log_store.rs:39-53 \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":"src/frontend/src/optimizer/plan_node/stream_dml.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4f79a7221b94c3ad777186f392eb91fcd7e9d07c1d98dc89e4c42e34e47f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/meta/src/controller/catalog/mod.rs:1117-1127 | src/meta/src/controller/catalog/mod.rs:1276-1283 | src/meta/src/controller/catalog/mod.rs:1309-1319 | src/meta/src/controller/catalog/mod.rs:1321-1330 | src/meta/src/controller/catalog/mod.rs:1332-1342 \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":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b66ed9330d79908e817479ed5da4e3232f8866caa87fa32c05a7ad00422d78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/meta/src/hummock/mod.rs:101-129 | src/meta/src/hummock/mod.rs:135-156 | src/meta/src/hummock/mod.rs:162-192 | src/meta/src/hummock/mod.rs:199-250 | src/meta/src/rpc/metrics.rs:1133-1184 \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":"src/meta/src/hummock/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"17690dd7c795562ae70d131297cf32ee4d65c61557c899d5d370a374079c32ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/batch/executors/src/executor/hop_window.rs:144-200 | src/expr/core/src/expr/test_utils.rs:96-191 | src/frontend/src/optimizer/plan_node/generic/hop_window.rs:191-288 | src/stream/src/executor/hop_window.rs:72-224 \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/batch/executors/src/executor/hop_window.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"271cebb86a4b147f88cd7b8ba660540059713714e8df4a5c84ebd9558d7c2aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/meta/src/controller/catalog/alter_op.rs:39-65 | src/meta/src/controller/catalog/alter_op.rs:286-625 | src/meta/src/controller/catalog/alter_op.rs:824-864 | src/meta/src/controller/catalog/alter_op.rs:870-899 \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/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea8c05414edcc343c94a54b0d0037c110ae2a58c1e3398c99e3666d7d15b8d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/risedevtool/src/task/compactor_service.rs:65-102 | src/risedevtool/src/task/compute_node_service.rs:67-124 | src/risedevtool/src/task/frontend_service.rs:89-115 | src/risedevtool/src/task/meta_node_service.rs:243-287 \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/risedevtool/src/task/compactor_service.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"56536dd4d93902e121f9e1ae8f861db4c00f781ed93c8edb5ba9f7c70d9c0bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java:87-120 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/PostgresDialect.java:117-158 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SnowflakeDialect.java:63-109 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java:123-156 \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":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"943e1f3d4645632655b8cde5c80f40d7746e64b46d4fcac5787bfdd67b226d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (101\u2013104 lines \u00D7 2): src/stream/src/executor/asof_join.rs:324-424 | src/stream/src/executor/hash_join.rs:585-688 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b63ed9edc37fb3b765be162e8d92ca6527c1dd0f55753cad344288153f2838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (74\u201375 lines \u00D7 2): src/batch/executors/src/executor/join/distributed_lookup_join.rs:92-166 | src/batch/executors/src/executor/join/local_lookup_join.rs:294-367 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/batch/executors/src/executor/join/distributed_lookup_join.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4756914aee01a90fe1fd1333a62ba80b4fce074bbae8d9f5de610169c3cfe29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): src/connector/src/sink/coordinate.rs:160-212 | src/connector/src/sink/decouple_checkpoint_log_sink.rs:97-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/connector/src/sink/coordinate.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90bcd4ffa27111c6dfa9cc75d4ed64f7e72ac1894c588533a230eae111b54cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): src/storage/hummock_sdk/src/compact_task.rs:297-343 | src/storage/hummock_sdk/src/compact_task.rs:369-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compact_task.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd3e08ef04299434435dea7f99e6062be09bd2a908eb14054ab69eb224c30e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): src/stream/src/executor/nested_loop_temporal_join.rs:220-258 | src/stream/src/executor/temporal_join.rs:773-811 \u2014 before extracting anything, compare \u0060src/stream/src/executor/nested_loop_temporal_join.rs\u0060 and \u0060src/stream/src/executor/temporal_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a1a669b28daa49b2ab9486a168d0a8a96934e949befccb85a69f3c27db3fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): src/expr/impl/src/scalar/trigonometric.rs:258-295 | src/expr/impl/src/scalar/trigonometric.rs:312-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/trigonometric.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b83f20b0790d21d7924e5fc50c2eb5846d8611d116f33c826c61a5b774cf52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 3): src/connector/src/source/kafka/stats.rs:582-613 | src/meta/src/rpc/metrics.rs:999-1031 | src/storage/src/monitor/compactor_metrics.rs:275-305 \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":"src/connector/src/source/kafka/stats.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc263462c2d0de8b60518d72b1804ee43daf2ae30081d864bee867d87822584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): src/connector/src/sink/iceberg/writer.rs:331-360 | src/connector/src/sink/iceberg/writer.rs:457-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"42091d1fa2cef7e34f5aea7067a17d591d36d0c7903647a9ab70686f931ee94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3): src/storage/src/hummock/store/version.rs:707-737 | src/storage/src/hummock/store/version.rs:766-796 | src/storage/src/hummock/store/version.rs:832-862 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/storage/src/hummock/store/version.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f98539aa2a0fa7933f245d87678238e11e4fc9963598cd0885ccd5e020e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/meta/src/rpc/metrics.rs:1069-1099 | src/stream/src/executor/monitor/streaming_stats.rs:1517-1547 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/meta/src/rpc/metrics.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da147a0544c1df4a949ae8d4c4bca1665b0534b22f268072d73c3d6844926c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/connector/src/sink/iceberg/writer.rs:834-863 | src/connector/src/sink/iceberg/writer.rs:868-897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ed871d8dfbf8c4f8c6e396bcf9b4834fb8e1507450191c42325fd57429c68d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): src/frontend/src/catalog/system_catalog/pg_catalog/pg_constraint.rs:61-89 | src/frontend/src/catalog/system_catalog/pg_catalog/pg_constraint.rs:97-126 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/catalog/system_catalog/pg_catalog/pg_constraint.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2de81fe12d28657e9307836da5dcc029b34f0b11cf23f55f997b3e51e65241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201330 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_join.rs:395-424 | src/frontend/src/optimizer/plan_node/logical_join.rs:1276-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":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0556a29b9bba23ecc441e76a509795e0b4928bf39e218e2cd6ccfcde564e0f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/meta/src/barrier/backfill_order_control.rs:95-124 | src/meta/src/barrier/backfill_order_control.rs:162-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":"src/meta/src/barrier/backfill_order_control.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6193a7b6ecd7fc0fe587960bbc5f1780d881e865da36925eba284648fd9fc41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/stream/src/executor/dynamic_filter.rs:144-173 | src/stream/src/executor/filter.rs:113-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1541d66af951731e2f44dc25f7245dd33a1491db0ca59bbce9b21de82f5a9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:2475-2503 | src/batch/executors/src/executor/join/nested_loop_join.rs:208-236 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"501c5f1031597dacb1cd0b004bbeaf5d217264a776bfd444411189681f0df410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/connector/src/source/cdc/external/postgres.rs:539-567 | src/connector/src/source/cdc/external/postgres.rs:583-611 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c789dd534d999820e1bbac2b654abcab9c1d450d215ca7a0b8e427ff2d6b569d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): src/frontend/src/handler/alter_owner.rs:196-223 | src/frontend/src/handler/alter_set_schema.rs:140-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/handler/alter_owner.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d85524d66300b09dfeb67728994a0fae6c5ff8fed36e0503d927b6b3c877b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): src/connector/src/parser/unified/debezium.rs:1242-1268 | src/connector/src/parser/unified/debezium.rs:1315-1342 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/parser/unified/debezium.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd3186d639a389fa8637e01616da91076e5a0ae005360cebbf0d2bc9a7c551f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): src/frontend/src/handler/create_aggregate.rs:93-118 | src/frontend/src/handler/create_function.rs:143-170 \u2014 before extracting anything, compare \u0060src/frontend/src/handler/create_aggregate.rs\u0060 and \u0060src/frontend/src/handler/create_function.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_aggregate.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a40343df31c8cdc7fca0174400473cbb536a1d370a3dee61d7261745331a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/stream/src/executor/eowc/eowc_gap_fill.rs:160-187 | src/stream/src/executor/gap_fill.rs:343-370 \u2014 before extracting anything, compare \u0060src/stream/src/executor/eowc/eowc_gap_fill.rs\u0060 and \u0060src/stream/src/executor/gap_fill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ae0bdd10c818a84f54e98281f35583a262593532e011b4661fe9463d80ed1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/jni_core/src/lib.rs:706-739 | src/jni_core/src/lib.rs:934-960 \u2014 both copies are in the same file, so extract the block into one function there 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/jni_core/src/lib.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03a03f84513c28334e1a26ced5797788c927efa992dc3e521a6be56574a5f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/stream/src/executor/backfill/cdc/upstream_table/snapshot.rs:229-255 | src/stream/src/executor/backfill/cdc/upstream_table/snapshot.rs:313-339 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/backfill/cdc/upstream_table/snapshot.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"39214b3bd4e618fe683bf2c24ad17847f0c0031a25bf848964bdac4bfc8e448c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/stream/src/executor/gap_fill.rs:648-674 | src/stream/src/executor/gap_fill.rs:725-751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8482f4b7c551848b4359da838513001b1c4d4030d481bfd99d791ee76bcd0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:973-998 | src/batch/executors/src/executor/join/hash_join.rs:1184-1208 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9490e8209e5fdda16d32d8ffcae491be587b26ac77a795b056713990c99313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/connector/src/sink/redis.rs:105-130 | src/connector/src/sink/redis.rs:132-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/redis.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d00188e45f068791191bd0fb897c1a0954a149835e3d90197234aae6ec5907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_project_set_transpose_rule.rs:55-80 | src/frontend/src/optimizer/rule/apply_project_transpose_rule.rs:51-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/apply_project_set_transpose_rule.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3b73065ffb802b0404c0848482fd6e8c57f8548d9fa0053097d68f2aa5106a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/frontend/src/webhook/websocket.rs:497-522 | src/frontend/src/webhook/websocket.rs:548-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/webhook/websocket.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5df870b591ffe249307113fbc1bb68f97d6b932bd11eb4ec6b9513e8f948c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): src/stream/src/executor/eowc/eowc_gap_fill.rs:208-230 | src/stream/src/executor/gap_fill.rs:399-424 \u2014 before extracting anything, compare \u0060src/stream/src/executor/eowc/eowc_gap_fill.rs\u0060 and \u0060src/stream/src/executor/gap_fill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"52059280754a711b96e1be389b63fb153c779557990ee49820fa96d9db5b4f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/compute/src/rpc/service/monitor_service.rs:422-446 | src/compute/src/rpc/service/monitor_service.rs:449-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/rpc/service/monitor_service.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baeb5deb08c78d2d79afec878acf19ca8bd7d01708d659e49fc7b1b7b34f418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:364-388 | src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:952-976 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"568e6362ea441c27e648a69a79d6ca3563da907a3bf456155c77fb14ce8866e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/stream/src/executor/gap_fill.rs:606-630 | src/stream/src/executor/gap_fill.rs:699-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73f06282568f2faa1df64484fd6cbaa3fa6c17fa987348f2d96a48d3a9629a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/stream/src/executor/mview/materialize.rs:469-493 | src/stream/src/executor/mview/materialize.rs:534-558 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mview/materialize.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a83a77a32d92a9576f30e205cbb4c0d7d8928b43207fc3c8f69f41ee54eb1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/stream/src/executor/top_n/top_n_cache.rs:508-531 | src/stream/src/executor/top_n/top_n_cache.rs:773-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":"src/stream/src/executor/top_n/top_n_cache.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7370dc9350fad6f1374bd5e305a4fd9b74e3c9b5fa365d1a121f06f4564774c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/batch/executors/src/executor/hop_window.rs:146-166 | src/stream/src/executor/hop_window.rs:77-100 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hop_window.rs\u0060 and \u0060src/stream/src/executor/hop_window.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"src/batch/executors/src/executor/hop_window.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc301481fa47e624cb641cc9e52b8a58c98489793259cf1f621adf7c2c864b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_join.rs:443-463 | src/frontend/src/optimizer/plan_node/logical_join.rs:1214-1237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c31b612c3375b12229965073ac1416002672764581de64dbf24b75ff994d2a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/frontend/src/scheduler/local.rs:363-386 | src/frontend/src/scheduler/local.rs:401-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35e2865d95fcfb79132491fa2d028142c401193cd6d93d7ccb55f0e25a41a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/meta/model/migration/src/m20240701_060504_hummock_time_travel.rs:72-95 | src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs:161-183 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/meta/model/migration/src/m20240701_060504_hummock_time_travel.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3085259f90bf346b77b1c416f7c6fc1118c709f5f0f47b859b297641dff6ed73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/meta/src/dashboard/prometheus.rs:85-108 | src/meta/src/dashboard/prometheus.rs:111-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/dashboard/prometheus.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"496609f5976187c764124261f4936b6a08f6797922e1ec148008e83268626e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/stream/src/executor/asof_join.rs:601-621 | src/stream/src/executor/asof_join.rs:787-810 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/asof_join.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"5447ed7522714131be3a739bb0110ca025d9e092e1d36b33a3fcdf07fc5c7a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/batch/src/task/consistent_hash_shuffle_channel.rs:79-101 | src/batch/src/task/hash_shuffle_channel.rs:75-97 \u2014 before extracting anything, compare \u0060src/batch/src/task/consistent_hash_shuffle_channel.rs\u0060 and \u0060src/batch/src/task/hash_shuffle_channel.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/src/task/consistent_hash_shuffle_channel.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e231bb40e7395dd3d22a96c5691d1a55f31b5b940faba241794c97198f933a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201323 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_hash_join.rs:70-86 | src/frontend/src/optimizer/plan_node/stream_join_common.rs:58-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":"src/frontend/src/optimizer/plan_node/batch_hash_join.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae1c22a4b071c40868306d869bf8728d7829b6049cc1f3a384a5a7c28e7446d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs:55-77 | src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs:151-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6c00de08c22bc4fe951a50b5b3a47709ec967312a25e39bdc176d3ce10de94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/storage/src/table/batch_table/mod.rs:631-653 | src/storage/src/table/batch_table/mod.rs:1410-1432 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/table/batch_table/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"732eef68469e427989fc6b11337f1c245cb433fd943553634e06f7efb7e63153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:164-186 | src/stream/src/executor/source/fs_list_executor.rs:106-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd497da6015155be6716e6385bacaefe7bbbd7c177e412404ccb1a2213cf013b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/connector/src/sink/iceberg/commit.rs:369-390 | src/connector/src/sink/iceberg/commit.rs:550-571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/commit.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9e18a3c68411d92299f8642c1a733ab2288be08c84858aa3acbf63a6e2ea54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/frontend/planner_test/src/lib.rs:448-469 | src/frontend/src/handler/mod.rs:468-489 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee9c94287713390ffc3b817a7f9d516e9c4be543101020029c6d9146b80f0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/frontend/src/optimizer/rule/min_max_on_index_rule.rs:93-114 | src/frontend/src/optimizer/rule/min_max_on_index_rule.rs:164-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/min_max_on_index_rule.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"966f1b19741a0e63e7b1ffe024a21a8ac0fc7c82c0350fc3ce477a652bc4032c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/frontend/src/handler/describe.rs:366-387 | src/frontend/src/utils/stream_graph_formatter.rs:238-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/describe.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0656dfcb69db4edf7ed5c96adeab5ea1d1ddbded803c44268bc0573afae8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/meta/service/src/ddl_service.rs:1183-1204 | src/meta/service/src/ddl_service.rs:1239-1260 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/service/src/ddl_service.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba268bc81ba2bb901bbf7ff2ae3b103f9241ee000e5a5107d802c2fdbea39899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/meta/src/hummock/model/ext/hummock.rs:315-336 | src/storage/backup/src/meta_snapshot_v2.rs:257-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":"src/meta/src/hummock/model/ext/hummock.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c48ed8b43b96eccbe9f0cd27380a779eb7c42d59a3f0d95c834f91e853ef2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/sqlparser/src/parser.rs:5889-5910 | src/sqlparser/src/parser.rs:6600-6621 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/parser.rs"},"region":{"startLine":5889}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc304f0da17e4c8cf9b63190c67c908665f891a0ab21dd7ffc770202f9923341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): src/storage/src/hummock/iterator/skip_watermark.rs:361-380 | src/storage/src/hummock/iterator/skip_watermark.rs:431-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/iterator/skip_watermark.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"730c9408b5f0bc2c0111e2d95f0ef0996b82b43ef813738e852d6297c080b7ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/stream/src/executor/source/fs_fetch_executor.rs:464-485 | src/stream/src/executor/source/iceberg_fetch_executor.rs:410-431 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/fs_fetch_executor.rs\u0060 and \u0060src/stream/src/executor/source/iceberg_fetch_executor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"767808cd4d0894566eaa81aeeff4843fb3e51b7052b2007e2976082eac73f7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/stream/src/executor/top_n/group_top_n.rs:116-137 | src/stream/src/executor/top_n/group_top_n_appendonly.rs:122-143 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/group_top_n.rs\u0060 and \u0060src/stream/src/executor/top_n/group_top_n_appendonly.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/group_top_n.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"211c17b2f3ce1448948b4021ce730a20eae382f1c9be3ce57aef0ffeb073640b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): src/batch/executors/src/executor/azblob_file_scan.rs:93-113 | src/batch/executors/src/executor/gcs_file_scan.rs:82-101 | src/batch/executors/src/executor/s3_file_scan.rs:96-116 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/azblob_file_scan.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7284c2fffdf64fe861c9d06e9049ca5591e1ae495a090060e599e6178ee59d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:325-345 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:549-569 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:707-727 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"db15190b40c9198bfedc359024c656e2bf14e900cdcd8e51a6c8db065d4119d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:333-353 | src/batch/executors/src/executor/join/hash_join.rs:287-306 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/join/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"674063ffb454961eaa0362526d2b60acf5a1880994465749b77e229404716f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): src/compute/src/server.rs:517-537 | src/storage/compactor/src/server.rs:371-389 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/compute/src/server.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a6f3a2e54137ec8e16b287a0f739c12fbde32bdecf674f6afa103f046a91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:223-243 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:308-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":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"92afc3ef708246cf34d1e48a1c1134a56edd1ce6d7d98c935c482645619921a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/sqlparser/src/parser.rs:661-681 | src/sqlparser/src/parser.rs:1416-1436 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/parser.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be9708a0de3016a13ea3d5a4e37c8ffd298bd253650b3bd2d2d791d3db636da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): src/storage/src/hummock/store/version.rs:1104-1124 | src/storage/src/hummock/store/version.rs:1141-1156 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/hummock/store/version.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07ff053860a3ebc16a565cec7f83a5a999c9382b859bebd972099c4087d0384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/stream/src/common/table/state_table.rs:1957-1977 | src/stream/src/common/table/state_table.rs:2045-2065 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/common/table/state_table.rs"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe38a748638cf95775994ea934a28b3e537da154a816fc51ec4fe77e664633e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): src/stream/src/executor/backfill/cdc/cdc_backfill.rs:772-792 | src/stream/src/executor/backfill/cdc/cdc_backfill.rs:989-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":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4becfa992e54d35ed0e3888eb67b8bb9cf3a123e9b2326bddbfcf69dc116c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs:313-332 | src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs:356-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5c5970d412d778493c5529578bbcb23d75360381f94d8c2ac41bcf7613eaf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/stream/src/from_proto/asof_join.rs:48-68 | src/stream/src/from_proto/hash_join.rs:56-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/asof_join.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9b147287bcfba13544f364266c8f000f576b4e99f4f57c86e2b5ec58e2180b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs:126-145 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:148-167 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:206-225 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_iceberg_list.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c373e3fc3e63cb77ef640502090b56f402f89bf772eb88c0c63b8d0394a7eea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:817-836 | src/batch/executors/src/executor/join/hash_join.rs:909-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb13dbacaf3a10f892370b0b033a3904983b3a6baeb377af620a956c4f2f3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:1002-1021 | src/batch/executors/src/executor/join/hash_join.rs:1621-1640 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cc72db3b748001a8e07653b3e5bc559f58ebf24257a0c93b1e71435272219e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/connector/src/parser/config.rs:198-217 | src/connector/src/parser/config.rs:241-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/connector/src/parser/config.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb5957b287dfbed61b727232a8fec02d11b33763dca26dae8f326e2d1bc8640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/meta/src/stream/scale.rs:523-542 | src/meta/src/stream/scale.rs:577-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":"src/meta/src/stream/scale.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd60df898825a1fed33d4f45d215698fe73d386cd5cd822025df316f25cf4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/storage/hummock_sdk/src/sstable_info.rs:262-281 | src/storage/hummock_sdk/src/sstable_info.rs:312-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/sstable_info.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35b6816c5881eb07cc44e30ddaae7e5ba2f49f529945050538150c1baa3a547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): src/storage/src/hummock/local_version/pinned_version.rs:115-132 | src/storage/src/hummock/local_version/pinned_version.rs:137-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/local_version/pinned_version.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"971531682a509ff3853665079b0211648aaaaeae6d7280a3e4281c9acccf41be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs:65-83 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs:64-82 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_snapshots.rs:43-61 \u2014 before extracting anything, compare \u0060src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs\u0060 and \u0060src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ad0d21cdb4cd8214abff48cd271e0e71e899e83d287f36d62bebd782daba6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/batch/executors/src/executor/delete.rs:179-195 | src/batch/executors/src/executor/update.rs:212-230 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/delete.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfb2d53675a31ba6438279f068ce9a02b28883699d7d50ccec320acc2d57801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/batch/executors/src/executor/join/nested_loop_join.rs:393-410 | src/batch/executors/src/executor/join/nested_loop_join.rs:479-497 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/nested_loop_join.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"10626700f9ab039d3f7c8e6de58c3cf90c30dbd5f119b5738bccd7fbebb7761b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/batch/executors/src/executor/project_set.rs:83-101 | src/frontend/src/datafusion/project_set.rs:312-329 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/batch/executors/src/executor/project_set.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d4b05017a4bad84b4d31348d3e7d1e91f32ee00ec3353311717990b596b933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/connector/src/sink/coordinate.rs:134-152 | src/connector/src/sink/decouple_checkpoint_log_sink.rs:76-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":"src/connector/src/sink/coordinate.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb79cd10612ee5e0c5108a9d5673f9a2ca3a6310a9a828e2b519776118df372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/connector/src/sink/doris_starrocks_connector.rs:306-324 | src/connector/src/sink/doris_starrocks_connector.rs:636-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/doris_starrocks_connector.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09257abc02708cea731260d4c55c600e177202173bfffdcc419911fbab442aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_over_window.rs:102-120 | src/frontend/src/optimizer/plan_node/stream_over_window.rs:162-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_over_window.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f99b30c58002c32a388d8886e86ba2f94c9eefe873e7cf08aa221775cb08063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_project.rs:375-392 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:376-394 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_project.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_project_set.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_project.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7297bf16ad1b0c0e460b608d7f8bda0e7c82d05b3801b1cb64cb4ade8903aab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_scan.rs:243-261 | src/frontend/src/optimizer/rule/top_n_on_index_rule.rs:101-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_scan.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c777ba5704eefcde724933d00aa3e35044238cca719a6459acb70396c2c853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/frontend/src/scheduler/local.rs:543-561 | src/frontend/src/scheduler/local.rs:566-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7977862bea98dabdc39adc3d02f1ae7e3d4ff77a68172f91da7abaa474fe9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/meta/src/hummock/compaction/picker/space_reclaim_compaction_picker.rs:83-101 | src/meta/src/hummock/compaction/picker/space_reclaim_compaction_picker.rs:137-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/picker/space_reclaim_compaction_picker.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e06a779a22db8bbedd12e83a5d5a0af00169053eb55808fd65505f35dbef2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/meta/src/rpc/ddl_controller.rs:1373-1391 | src/meta/src/rpc/ddl_controller.rs:1432-1450 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e996bbf10cd87a8d2ad503e3e1d0b3cc1c62f4e04698fdbcd52716dcdff198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/storage/compactor/src/server.rs:364-380 | src/storage/compactor/src/server.rs:472-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/compactor/src/server.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"35555d04586650bd212ec4a6fe21e8b5e75371031d0530bfc266f1eda38ace1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/storage/src/hummock/store/local_hummock_storage.rs:441-459 | src/storage/src/memory.rs:1120-1138 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/storage/src/hummock/store/local_hummock_storage.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed6e45d33256b6374a68527d22edd731b4eff65e64f86045b1ed1dab653517e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/stream/src/executor/nested_loop_temporal_join.rs:194-212 | src/stream/src/executor/temporal_join.rs:736-754 \u2014 before extracting anything, compare \u0060src/stream/src/executor/nested_loop_temporal_join.rs\u0060 and \u0060src/stream/src/executor/temporal_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a549eac39513c13eb6054569b1cfb8b63c9fd840101e761dff41c9f19708a889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201319 lines \u00D7 2): src/stream/src/executor/source/source_backfill_executor.rs:237-255 | src/stream/src/executor/source/source_backfill_executor.rs:276-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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9561da7b434965983ff9795502f6c0bd25757ee4381ca1c00c6fa9880700f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/stream/src/executor/top_n/top_n_cache.rs:419-437 | src/stream/src/executor/top_n/top_n_cache.rs:459-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":"src/stream/src/executor/top_n/top_n_cache.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f9d7548ade3592f5626100112ec126b52197eac5524a10f4ad3308f08809a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/stream/src/from_proto/eowc_gap_fill.rs:52-70 | src/stream/src/from_proto/gap_fill.rs:50-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/eowc_gap_fill.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e09ba6afb626af2e567a169d875262cafc45c0ef1d9e46395c4e3fcdcc6f2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:803-820 | src/batch/executors/src/executor/join/hash_join.rs:885-901 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da304c2a2b66cc27e1456bbe2f5a26b9f62af4f1afc34f156be5ede49a5dccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/connector/src/sink/batching_log_sink.rs:67-84 | src/connector/src/sink/writer.rs:150-167 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/connector/src/sink/batching_log_sink.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aabd7e5f1cd1ab283f17bcf9808de7d628b2dd3cc1e015a2efa1f065fca3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/expr/impl/src/scalar/jsonb_delete.rs:352-369 | src/expr/impl/src/scalar/jsonb_set.rs:114-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/jsonb_delete.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf2dbd4de8267434c1973b16cb4a7becc90558166c780164d50549e582787e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/frontend/src/handler/create_table.rs:599-615 | src/frontend/src/handler/create_table.rs:867-884 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/handler/create_table.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f3502d49e9fcc752a59fc75ddc6f665600296b6ecfe4590979835947ab40e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/frontend/src/metrics_reader.rs:108-125 | src/frontend/src/metrics_reader.rs:137-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":"src/frontend/src/metrics_reader.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a888ef777d062039d8bf18e7e0b6d9de89f78622fb37801739b81fe967804f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_multi_join.rs:371-387 | src/frontend/src/optimizer/plan_node/logical_multi_join.rs:643-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_multi_join.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea7d4498131a7ca2db3d9377821ec561c6eeefc13df039f095590b55bc957fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_project.rs:109-125 | src/frontend/src/optimizer/plan_node/stream_project_set.rs:71-88 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_project.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c6aee0ce12336950426d19a353e76bdc47a25344b7a5008717d416550bde0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/frontend/src/handler/create_function.rs:118-135 | src/frontend/src/handler/create_sql_function.rs:100-117 \u2014 before extracting anything, compare \u0060src/frontend/src/handler/create_function.rs\u0060 and \u0060src/frontend/src/handler/create_sql_function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_function.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3398287d61ba8a2defd32ad5bd02c8cdc863908b6b1d4a70d015166c39f63f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/meta/service/src/hummock_service.rs:440-457 | src/meta/service/src/hummock_service.rs:492-509 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/service/src/hummock_service.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b70733ebf823c9965545435f6dc45a72f4d26b6fa13efeecdb51e8cd0d0bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs:469-484 | src/meta/src/barrier/checkpoint/state.rs:229-246 \u2014 before extracting anything, compare \u0060src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs\u0060 and \u0060src/meta/src/barrier/checkpoint/state.rs\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5d2e123959c058677ff9e1c3bd42a94b0c14382b08ad030327639374757399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/meta/src/barrier/checkpoint/state.rs:524-541 | src/meta/src/barrier/checkpoint/state.rs:857-874 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d7e12428b1bff99c1105622c9530a70b85489857153d76dd9405252942c2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/meta/src/dashboard/mod.rs:702-719 | src/meta/src/dashboard/mod.rs:785-802 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/dashboard/mod.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e11618f622fb3e887fd1de40551c519d4c7fe9a50806bfb501af5d7ae660b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/meta/src/dashboard/mod.rs:726-743 | src/meta/src/dashboard/mod.rs:807-824 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/dashboard/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"7372e7e41bfdfcd90a247a6955f3ac86ba830da82805c516677acf3b294d306f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:294-311 | src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:862-879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ef4495003f275c98ad04d869ff4ef332c4a93795b047c37f31f8d065d467ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:313-330 | src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:881-897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"93418f10123fcade53a394f64099c26a5d79a3e61a4d05545b43f04a00b5e3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/storage/src/hummock/iterator/skip_watermark.rs:206-223 | src/storage/src/hummock/iterator/skip_watermark.rs:566-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/iterator/skip_watermark.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a345029fc94f965fe680ae054432eaa82a8454fef7609f8d5724dc78e3c2d8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:492-509 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:688-702 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d55f3fc614d33cf21474081ac7889739015e4351b9de7098f1a897cffabb34e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/stream/src/executor/over_window/over_partition.rs:1047-1064 | src/stream/src/executor/over_window/over_partition.rs:1091-1108 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"a294e5dda46f5596cdd54f45afd7de63c4cc1bcd414533999933b51c62bbee22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:76-93 | src/stream/src/executor/source/batch_source/batch_posix_fs_list.rs:209-226 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_iceberg_list.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_posix_fs_list.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_iceberg_list.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a428e1616dbd730b7005b93810c99eb899620135fdb7fbf92e3ab9e5f59756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/stream/src/executor/top_n/top_n_state.rs:179-196 | src/stream/src/executor/top_n/top_n_state.rs:283-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/top_n_state.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"522cc335f17441621f1ef599265c115a3cc956a68541400a4300d0cabfb7f2f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 3): src/connector/src/connector_common/iceberg/mod.rs:663-674 | src/connector/src/connector_common/iceberg/mod.rs:730-741 | src/connector/src/connector_common/iceberg/mod.rs:786-802 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"73391ea7a4dc0d977096745fa75b0c7393a840ee7c17979a0c6be5cd7859f75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:1325-1341 | src/batch/executors/src/executor/join/hash_join.rs:1442-1458 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4afdeae8b82932fa077f11ae3d46825183a43ddea4c0bb5d25088b135a63fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/batch/src/task/consistent_hash_shuffle_channel.rs:118-134 | src/batch/src/task/hash_shuffle_channel.rs:114-130 \u2014 before extracting anything, compare \u0060src/batch/src/task/consistent_hash_shuffle_channel.rs\u0060 and \u0060src/batch/src/task/hash_shuffle_channel.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/src/task/consistent_hash_shuffle_channel.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd93017b9d0fefb6fde3356b479b7de12f6f25f42cf52a16d2d9445e7e4aa65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): src/cmd_all/src/standalone.rs:131-141 | src/cmd_all/src/standalone.rs:145-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":"src/cmd_all/src/standalone.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b7c60492d9f2db33137e7053f79ffbb40c86e7f8aba4a6c64f5f3cd5e6205f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/frontend/src/datafusion/aggregate/single_phase.rs:331-347 | src/frontend/src/datafusion/aggregate/two_phase.rs:304-320 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/datafusion/aggregate/single_phase.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cf4b18c8ae0643f24b18e84040b3d3e5a09284e051e1dd87912c098e473c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/frontend/src/expr/table_function.rs:296-312 | src/frontend/src/expr/table_function.rs:383-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":"src/frontend/src/expr/table_function.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"727b09d30718436802c69130a70895a749b85d5e44027085e3db0b05fb017771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/frontend/src/metrics_reader.rs:155-170 | src/meta/src/dashboard/mod.rs:924-940 \u2014 before extracting anything, compare \u0060src/frontend/src/metrics_reader.rs\u0060 and \u0060src/meta/src/dashboard/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/metrics_reader.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f817e7edfc85536f8d46a9d85b336e32b8a271b0a2f094b6c1ea006ec4e5fd58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/frontend/src/optimizer/rule/table_function_to_mysql_query_rule.rs:44-60 | src/frontend/src/optimizer/rule/table_function_to_postgres_query_rule.rs:45-61 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/rule/table_function_to_mysql_query_rule.rs\u0060 and \u0060src/frontend/src/optimizer/rule/table_function_to_postgres_query_rule.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/table_function_to_mysql_query_rule.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7de640135b11dac4f56598f674a5de35779ce3bcb6e5e1d25b4c22d7fb6ba1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs:282-298 | src/meta/src/barrier/checkpoint/state.rs:358-374 \u2014 before extracting anything, compare \u0060src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs\u0060 and \u0060src/meta/src/barrier/checkpoint/state.rs\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a46052744c6265aaabd7a2c339b7df6482dbef91c4cca593702a56a8d276f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs:452-467 | src/meta/src/barrier/checkpoint/state.rs:207-223 \u2014 before extracting anything, compare \u0060src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs\u0060 and \u0060src/meta/src/barrier/checkpoint/state.rs\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/batch_refresh_job/mod.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"70866d4e8cccbd96055703d0b4db539d65e40655225dc7ffcdab924a2e8a6b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/meta/src/barrier/checkpoint/state.rs:564-580 | src/meta/src/barrier/checkpoint/state.rs:699-715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c589c69c8ad24780997aee1f2bd3b5304f2d002f9becd109fe22fa7d49f3200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/meta/src/barrier/rpc.rs:132-146 | src/meta/src/stream/stream_graph/fragment.rs:1463-1479 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/meta/src/barrier/rpc.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d331eb7ed549f1701b61ae330021dc42419d4969bf0ba8325b05c83e70e9c49a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:336-352 | src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:915-931 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"97795fa47547346c7a11edc3c4a41084388785d5eea00a85eb3bfdc1a3ad2e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/storage/src/hummock/iterator/mod.rs:398-414 | src/storage/src/hummock/iterator/mod.rs:436-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/iterator/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8abe571f1212f467bb62e8a80cb610d757af3b967b6471b068f3cc16e013115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/storage/src/hummock/utils.rs:436-451 | src/storage/src/hummock/utils.rs:480-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/utils.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe44a35b1efeff5e9c373070f2cf9feb79bb53408b4518a36c7c62db2f7c2b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/stream/src/executor/asof_join.rs:553-569 | src/stream/src/executor/hash_join.rs:851-867 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a4d97cb3d69a36ba8bc20120413a86d0857d52aa7aa31782222e5f3060c7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/stream/src/executor/join/asof_join.rs:480-496 | src/stream/src/executor/join/asof_join.rs:540-556 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/join/asof_join.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adf0c7462205408d70f17d0f492076e93148134b8a2f221e542495a4b28baa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/stream/src/executor/mview/cache.rs:198-214 | src/stream/src/executor/mview/cache.rs:254-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mview/cache.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb95014d712cbfe47e13dbcb2cf134eacce739a6730eb1bc25bbcc1427fc703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/stream/src/executor/project/project_scalar.rs:339-355 | src/stream/src/executor/project/project_set.rs:132-148 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/executor/project/project_scalar.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aefdf8f1df54bc848eec4146c37ad298c338a19a88d33ca0ef256119d0cfbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/stream/src/executor/top_n/group_top_n.rs:180-196 | src/stream/src/executor/top_n/group_top_n_appendonly.rs:163-179 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/group_top_n.rs\u0060 and \u0060src/stream/src/executor/top_n/group_top_n_appendonly.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/group_top_n.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3503757678d91c823b39302e705e2e6af4848a7edeea01f9cd175f967c965b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/utils/pgwire/src/ldap_auth.rs:240-256 | src/utils/pgwire/src/ldap_auth.rs:344-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/ldap_auth.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac966794824a23c7cfac5ca0f28acdddbf3b400cdd8aef84b712b546183209a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): src/frontend/src/optimizer/plan_node/batch_hash_join.rs:107-121 | src/frontend/src/optimizer/plan_node/batch_lookup_join.rs:131-146 | src/frontend/src/optimizer/plan_node/stream_delta_join.rs:111-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/optimizer/plan_node/batch_hash_join.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb1cf5a399b5d6db938b3c7bc4573331cd70aa67478d8ff9258fea27bac620e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:356-369 | src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs:944-957 | src/storage/hummock_sdk/src/compaction_group/mod.rs:323-338 \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":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e716df607b1cf29b6007455ce06c9f339e65202d9b52b6bbf80ac86b7e6ade7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/batch/executors/src/executor/log_row_seq_scan.rs:107-122 | src/batch/executors/src/executor/row_seq_scan.rs:97-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/log_row_seq_scan.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c2a5a4ba9204be79de18d9bc4fb43da5bdb865dbe926cc3d5eed1185794bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/batch/executors/src/executor/sort_over_window.rs:63-78 | src/stream/src/from_proto/over_window.rs:42-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/batch/executors/src/executor/sort_over_window.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19ba017c990930cd6366cb46690bfe1f3a5f7a6cc9fa7b3705b4ffc7d94c369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_kafka_scan.rs:123-138 | src/frontend/src/optimizer/plan_node/batch_source.rs:107-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/batch_kafka_scan.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d27d671c39019a133733b45586831927046f6d976a4da4c8b23e676ad673b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_dedup.rs:93-108 | src/frontend/src/optimizer/plan_node/logical_over_window.rs:729-744 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/logical_dedup.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb054eb2df11f5190a93e2f1553ba56352ef70276748af17eb191988048a7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/frontend/src/optimizer/rule/batch/batch_project_merge_rule.rs:29-44 | src/frontend/src/optimizer/rule/stream/stream_project_merge_rule.rs:29-44 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/optimizer/rule/batch/batch_project_merge_rule.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"04795bd2a0dcce8f8ebfb5e117be4443774193b6ff1cbc1af79c5e5af6154163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/frontend/src/optimizer/rule/pull_up_hop_rule.rs:72-84 | src/frontend/src/optimizer/rule/pull_up_hop_rule.rs:109-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/pull_up_hop_rule.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c1c35a6d626e5bbf9789decbd84f7f2d1c3054a477f50aee19c28b1808120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/frontend/src/handler/create_function.rs:100-114 | src/frontend/src/handler/create_sql_function.rs:81-96 \u2014 before extracting anything, compare \u0060src/frontend/src/handler/create_function.rs\u0060 and \u0060src/frontend/src/handler/create_sql_function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_function.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f9e31a706a6585a580a339654638870e8fe32788256df85fe2cffbac342c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/frontend/src/handler/alter_rename.rs:204-219 | src/frontend/src/handler/alter_source_props.rs:142-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/handler/alter_rename.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6a35ebe23a7fdb25871c14de94493d83914bcf262227b1996a36cff0b975d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/meta/src/barrier/checkpoint/recovery.rs:394-409 | src/meta/src/barrier/checkpoint/recovery.rs:476-491 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/barrier/checkpoint/recovery.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e587fbe827a9e6e5496123e5c3c20451b551ed1837e90d4400e62d88562775f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:593-608 | src/meta/src/controller/streaming_job.rs:666-681 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de1f39edff779daac79c1a91685b9df25ff835203c7271f72408cbd70dbe725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/meta/src/hummock/compaction/picker/intra_compaction_picker.rs:374-389 | src/meta/src/hummock/compaction/picker/tier_compaction_picker.rs:97-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/picker/intra_compaction_picker.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"de40f503e411d6a6816d60aa64fa4414f4a90cda1fe989bd7a7295313365963a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:137-152 | src/meta/src/controller/catalog/alter_op.rs:230-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edbfd8431c03958075b77185d63eb9a422c8954235aa4960ff10bf81aa5c668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/storage/src/hummock/store/version.rs:906-921 | src/storage/src/hummock/store/version.rs:955-970 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/hummock/store/version.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"008d42d7a0190bd822334e373150482c2b35cdbe485db7d4710ba4a3783dbdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/storage/src/memory.rs:177-190 | src/storage/src/memory.rs:212-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/memory.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa22697c5d890d490aff39b39867cbe5824ac4edd05268078cee410626558579"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/asof_join.rs:425-440 | src/stream/src/executor/asof_join.rs:451-466 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/asof_join.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c696c84482f670eb5fc3ff80be01a4d115ac854617258de6e530943d9b152f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/asof_join.rs:435-450 | src/stream/src/executor/hash_join.rs:701-716 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6769a03a49162236d54ec9496e1d69c49215ddf5f091b6edcd21e558affc86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/asof_join.rs:622-637 | src/stream/src/executor/asof_join.rs:724-739 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/asof_join.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d475e8dd1fae89488748b707587765e68ca1946ef201295b489e9716454e7974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/stream/src/executor/backfill/cdc/cdc_backfill.rs:382-397 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:151-164 \u2014 before extracting anything, compare \u0060src/stream/src/executor/backfill/cdc/cdc_backfill.rs\u0060 and \u0060src/stream/src/executor/backfill/cdc/cdc_backill_v2.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc13241b19a2b7bf1dc41c1cc816d507da691d3f0e7225774312026717e3c65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/eowc/eowc_gap_fill.rs:191-206 | src/stream/src/executor/gap_fill.rs:381-396 \u2014 before extracting anything, compare \u0060src/stream/src/executor/eowc/eowc_gap_fill.rs\u0060 and \u0060src/stream/src/executor/gap_fill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49732f491dcdb4198f1e091808c3fedfca926533179be29febf90dcefe0833a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/gap_fill.rs:632-647 | src/stream/src/executor/gap_fill.rs:752-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ae836061c1a497de3447066d0ae6ce8da8b85ce1d6e13ec72b0582a98283a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/hash_join.rs:691-706 | src/stream/src/executor/hash_join.rs:719-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":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a21e72d8659c9d87b5581b052ec1ce2258b33971ff1a499b716944da03678a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/top_n/top_n_appendonly.rs:87-102 | src/stream/src/executor/top_n/top_n_plain.rs:113-128 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/top_n_appendonly.rs\u0060 and \u0060src/stream/src/executor/top_n/top_n_plain.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/top_n_appendonly.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27d2172bc62077f6e0d118eee2a6e3a1e83c46601ce65f01067f96028bc6020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/stream/src/from_proto/source/trad_source.rs:178-192 | src/stream/src/from_proto/source_backfill.rs:46-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/source/trad_source.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ac2c206574e1e3a69c7cf12e516b0018ee3f16b599dfe217bfbb2a4c52c4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/stream/src/task/barrier_worker/managed_state.rs:1237-1252 | src/stream/src/task/barrier_worker/managed_state.rs:1255-1269 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/task/barrier_worker/managed_state.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b7b403059cf8404d09d2b7a5515d7927eeb66bcbfaaea9d82223674538037a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs:130-144 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:152-166 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:210-224 | src/stream/src/executor/source/batch_source/batch_posix_fs_list.rs:249-263 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_iceberg_list.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a0336404dde87ca8a95ee8659a13ec0846608938dcb88653e14ee83686d89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs:169-183 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:193-207 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:251-265 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_iceberg_list.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99f572dab9e5feb34864023628feefc7820550fd94ee6700326d2c2c70ee4e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/stream/src/executor/source/mod.rs:137-151 | src/stream/src/executor/source/mod.rs:162-176 | src/stream/src/executor/source/mod.rs:228-242 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/stream/src/executor/source/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34582e62d460cae4fdb77b6d12807dd0443a3d1a167436efb11fe0639bbaa7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/batch/executors/src/executor/join/mod.rs:111-125 | src/stream/src/executor/join/mod.rs:86-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":"src/batch/executors/src/executor/join/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb7bb9f2d23c24261fe2d1febb341cf20c810ef1b782dba0cc0ac1b80678936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/connector/src/source/cdc/external/mysql.rs:853-867 | src/connector/src/source/cdc/external/mysql.rs:870-882 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/source/cdc/external/mysql.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"113c80c1c563dbdb640c03558b8e7c3761ff3749a4ab9f35330fcf6354a18214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/connector/src/source/cdc/external/sql_server.rs:85-98 | src/connector/src/source/cdc/external/sql_server.rs:314-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":"src/connector/src/source/cdc/external/sql_server.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebf6acfd4f4111525b646f95062436674770667e7f3d9d048e3f5307cd3e9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/expr/impl/src/udf/wasm.rs:63-77 | src/expr/impl/src/udf/wasm.rs:151-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/udf/wasm.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f57810991f79a85ba19adb9a5c10eafae377c94288f7810f946a538c6a8347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/expr/macro/src/parse.rs:293-307 | src/frontend/macro/src/lib.rs:77-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/expr/macro/src/parse.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"533812b7d9c2c13bf9e8bc0a3848cb8ac7416473317e10944d788e01d5f63802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/frontend/src/metrics_reader.rs:213-227 | src/frontend/src/metrics_reader.rs:233-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":"src/frontend/src/metrics_reader.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e845461cc59a6ba6748278d541fc8b47b35b8d63cd3e31448bae5c3a311ce67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_hop_window.rs:172-186 | src/frontend/src/optimizer/plan_node/stream_hop_window.rs:141-155 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_hop_window.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc27ed06f157e76dfba5149ee8eec226d1da67374662dc7e7520974e793629dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_agg.rs:1541-1555 | src/frontend/src/optimizer/plan_node/logical_topn.rs:338-352 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f51ff64dc5a69eedc4cca3a48195906f1873ad78f8986049c228f78546dac2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/frontend/src/optimizer/rule/min_max_on_index_rule.rs:148-162 | src/frontend/src/optimizer/rule/top_n_on_index_rule.rs:85-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/min_max_on_index_rule.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f064739069c6b41a6a97623e1c7154b68f7d158f963740caed006ab4ce9f965c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/frontend/src/scheduler/distributed/stage.rs:748-762 | src/frontend/src/scheduler/local.rs:655-669 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"87feb816d34e93e4c9fddb553ebb6a856ca047ffd579a0c9db55fd1ecfcd4353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/frontend/src/planner/relation.rs:667-680 | src/frontend/src/planner/relation.rs:696-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/planner/relation.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"002c1d0a517a536ceb86f8cca54ccdbbeabefbf9e46d814936a4e15882da188b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/frontend/src/handler/alter_set_schema.rs:97-111 | src/frontend/src/handler/alter_set_schema.rs:114-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":"src/frontend/src/handler/alter_set_schema.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a7e6812bcd7d90562e1210a56b36313c16530545b72d59886b3fb550c3fa7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:2984-2998 | src/meta/src/controller/streaming_job.rs:3468-3481 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b83c4c8ce14d8ff09ef7e4f6dabb8e67861259bc831304607cf1e5a4bb8ae82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:3098-3111 | src/meta/src/controller/streaming_job.rs:3168-3182 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":3098}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a339bdeddcb112b301036a848a94248d39737cdc371d987f9587dc041b7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/meta/src/dashboard/mod.rs:580-593 | src/meta/src/dashboard/mod.rs:642-656 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/dashboard/mod.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"6523b92c374b818cb48a5306817cc1adbcc7992f8cd780bf755828adfc46bbf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/meta/src/hummock/compaction/selector/tombstone_compaction_selector.rs:60-74 | src/meta/src/hummock/compaction/selector/ttl_selector.rs:55-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/selector/tombstone_compaction_selector.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d41862da21cd2a780ade920467cf09dd05861743d8f1a36b8b0c27f05ee88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/meta/src/stream/stream_manager.rs:1073-1087 | src/meta/src/stream/stream_manager.rs:1104-1118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b99a84b98955d2f7deeb6214701989dc6b863e8f0d5d28a0724f16cbd73b3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/meta/src/controller/catalog/util.rs:442-456 | src/meta/src/controller/catalog/util.rs:490-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":"src/meta/src/controller/catalog/util.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dc03a107d31d48ac61405cf74b7ba7ca09924fab4819493a42477a85dd7454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/object_store/src/object/s3.rs:287-301 | src/object_store/src/object/s3.rs:367-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/object_store/src/object/s3.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"858b06ed5f3371e69ecd41cb798461424fb41fb527fd6a691b7adf08d8a4beff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/risedevtool/src/task/frontend_service.rs:68-82 | src/risedevtool/src/task/meta_node_service.rs:100-112 \u2014 before extracting anything, compare \u0060src/risedevtool/src/task/frontend_service.rs\u0060 and \u0060src/risedevtool/src/task/meta_node_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/task/frontend_service.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d0898fa67419d011d5f8197af81903376e7ea6df6cb58b35212561a84f8fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/storage/src/hummock/iterator/skip_watermark.rs:524-538 | src/storage/src/hummock/iterator/skip_watermark.rs:595-609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/iterator/skip_watermark.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f6d3d913acf9b43c52714463c42ce4d04f30a517fb9cc73fd0455a6950ecdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/storage/src/hummock/store/local_hummock_storage.rs:905-919 | src/storage/src/hummock/store/local_hummock_storage.rs:1024-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/store/local_hummock_storage.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1cfe2ac6df267e257efb47b6304faeb039b45e6cddd88a7edf0a5755bb9e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/stream/src/executor/backfill/arrangement_backfill.rs:341-355 | src/stream/src/executor/backfill/arrangement_backfill.rs:394-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/arrangement_backfill.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fbe8ada10a93249411a45ee83854fd3a9295fb35fe4a891be94ff54a875a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:281-294 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:651-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":"src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a1659f2c26592bd3e623da0ecbde79204a92a6241d4513f545e9083f050322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/stream/src/executor/eowc/eowc_gap_fill.rs:105-119 | src/stream/src/executor/eowc/eowc_gap_fill.rs:125-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b17e2175fd086bceffd90520126f4aad21aec6de15dd74613f6c06d0fc7e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/stream/src/executor/nested_loop_temporal_join.rs:161-175 | src/stream/src/executor/temporal_join.rs:688-701 \u2014 before extracting anything, compare \u0060src/stream/src/executor/nested_loop_temporal_join.rs\u0060 and \u0060src/stream/src/executor/temporal_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0255f09b7f012c7d6dea8e17c2a2d91505f9140df400113547463d8c3f6cde8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/stream/src/executor/source/fs_fetch_executor.rs:295-309 | src/stream/src/executor/source/iceberg_fetch_executor.rs:279-293 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/fs_fetch_executor.rs\u0060 and \u0060src/stream/src/executor/source/iceberg_fetch_executor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f752490151133fe1998528f881e0f202dd286912fe0c94fcff1d141e18e967b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/batch/executors/src/executor/join/hash_join.rs:1314-1327 | src/batch/executors/src/executor/join/hash_join.rs:1431-1444 | src/batch/executors/src/executor/join/hash_join.rs:1580-1593 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1571910f5ee0821ef59226cb56b1cc15c77fbd9c9e200b59815e17b7154278ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/common/metrics/src/monitor/process.rs:113-126 | src/common/metrics/src/monitor/process.rs:164-177 | src/common/metrics/src/monitor/process.rs:194-207 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/common/metrics/src/monitor/process.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"312051bc10ab0f032d15ad81dc60cc9d8fb9d14e93ccf86c98f68a2c5fa7754f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/expr/macro/src/gen.rs:165-178 | src/expr/macro/src/gen.rs:824-837 | src/expr/macro/src/gen.rs:1162-1175 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/expr/macro/src/gen.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0280e2924ad4f516b4a277fc2eeba8babc4bbfad5e86adc01656878fd0dcce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): src/frontend/src/optimizer/plan_node/logical_dedup.rs:197-208 | src/frontend/src/optimizer/plan_node/logical_gap_fill.rs:122-135 | src/frontend/src/optimizer/plan_node/logical_topn.rs:264-277 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_dedup.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f8cb02dbe317a52c621af3980395f8faf9e569ea6e92ef583018682894fb18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/frontend/src/scheduler/local.rs:333-346 | src/frontend/src/scheduler/local.rs:378-391 | src/frontend/src/scheduler/local.rs:416-429 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daf1335006f3d36277e8f01ed082d5b7671419d077a12deace809ad7a77e907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/meta/model/migration/src/m20240304_074901_subscription.rs:55-68 | src/meta/model/migration/src/m20240506_112555_subscription_partial_ckpt.rs:46-59 | src/meta/model/migration/src/m20240506_112555_subscription_partial_ckpt.rs:107-120 \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":"src/meta/model/migration/src/m20240304_074901_subscription.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc300f8703fc7a6f78626323de69b109f166b2b892285bbe35e8bf5a4486a468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/meta/src/dashboard/mod.rs:883-896 | src/meta/src/dashboard/mod.rs:910-923 | src/meta/src/dashboard/mod.rs:936-949 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/meta/src/dashboard/mod.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"39175fecad78a2dc94c9934ef643d6cd4d2aa67d5b201590959a03cfbe8f33d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): src/stream/src/common/table/state_table.rs:1538-1550 | src/stream/src/common/table/state_table.rs:1562-1573 | src/stream/src/common/table/state_table.rs:1586-1599 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacbdd87b5b88606d988ccec9124b68b89d2e5c64f9cfe66f69f00d25a3e3e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs:112-124 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:109-121 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:188-201 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_iceberg_list.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e994d14c5493c32fe1060020123c23af01722289d35a9ccb843a12ac8ae4df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:655-668 | src/batch/executors/src/executor/join/hash_join.rs:636-649 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/join/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2b9732751ba4f6a9f67bb8a0bb532fc65e0fa7b388d67e70fefee8bf298d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:1108-1121 | src/batch/executors/src/executor/join/hash_join.rs:1587-1600 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"828c884a7b2fa1708d4266d5df0bb1fba5aa40f923be16f2551fa49d67650021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:1271-1284 | src/batch/executors/src/executor/join/hash_join.rs:1521-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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf31ec53a92341b32b14e95f19609d2e0baecff1a54853473da9abd8e5d5b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/common/src/field_generator/numeric.rs:75-84 | src/common/src/field_generator/numeric.rs:117-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/field_generator/numeric.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"105f1871fa8e7dd5e7dd315ceeb2a3c3ee4544ff6c39a2ede074c72a515924fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/connector/src/sink/encoder/template.rs:430-443 | src/connector/src/sink/encoder/template.rs:448-461 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/encoder/template.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff6d6ec5fe57dde220ee3a918ca3c79e2204c159fd0d169cc4cd62f46b9c605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/connector/src/source/reader/fs_reader.rs:61-74 | src/connector/src/source/reader/reader.rs:71-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/reader/fs_reader.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b422a432bafb149d52d7aa8f4e9a10108e29e56ce4cfbfa1a3532d158995159c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/expr/core/src/error.rs:161-173 | src/expr/impl/src/scalar/string.rs:500-513 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/expr/core/src/error.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde46aedbd095d10b122114d63fd052a0b58d87bb96e234ac486d85478dc82c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/expr/impl/src/scalar/regexp.rs:403-416 | src/expr/impl/src/scalar/regexp.rs:435-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/regexp.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1db256e5f64d41f612eb50cd30c00daa9fde941fe65d6f493efd674f0713ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/expr/impl/src/scalar/string.rs:129-141 | src/expr/impl/src/scalar/string.rs:204-217 \u2014 both copies are in the same file, so extract the block into one function there 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/expr/impl/src/scalar/string.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f91c02fec7e4bc9decaf40d4cf6c9af9c12e94f5420a5f0c8a6bdeadca0d1cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/planner_test/src/lib.rs:343-356 | src/frontend/planner_test/src/lib.rs:374-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ecca3c803dff02cf71ea0be25f62c9b59f85f04a559cdc73401b0cf0c41bfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/binder/select.rs:472-485 | src/frontend/src/binder/select.rs:517-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/select.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8764c3ba6679e2a001ad407a90d3ac84224e13448fc648646dc987981eab323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/frontend/src/datafusion/aggregate/single_phase.rs:134-147 | src/frontend/src/datafusion/aggregate/two_phase.rs:138-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/datafusion/aggregate/single_phase.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc40e5f0853e083500a420d530095fa14acedafae61a7698ba0edf26002c9925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): src/frontend/src/datafusion/aggregate/two_phase.rs:276-283 | src/frontend/src/datafusion/aggregate/two_phase.rs:323-336 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/datafusion/aggregate/two_phase.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a089ffb6ec4319e9935b7a7cd010a66f8d28d25fa9bc7b788aecbb55603dce93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:653-666 | src/frontend/src/optimizer/rule/join_commute_rule.rs:88-101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a043e21c80431a604f0ff4df48e50d86ce11bfb0fca1e22b803c5529ec158e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/optimizer/rule/table_function_to_internal_backfill_progress.rs:64-77 | src/frontend/src/optimizer/rule/table_function_to_internal_source_backfill_progress.rs:62-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/table_function_to_internal_backfill_progress.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2a4727278517ce8ec6def24ddd0dbf09f1629ae6eb483cf4c994adee3872a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/scheduler/distributed/stage.rs:1071-1084 | src/frontend/src/scheduler/distributed/stage.rs:1091-1104 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bc44217e6a435ceda977e8e2d633e513428939a81c9c5412c285581cffb172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/session/transaction.rs:162-175 | src/frontend/src/session/transaction.rs:180-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/session/transaction.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4509911629fa76ccb7092cb29dfc4cac8dd5da208ebe8c56b8083b73292f8046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/handler/create_source/external_schema.rs:344-358 | src/frontend/src/handler/create_source/external_schema.rs:405-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source/external_schema.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf71aa62c3c7b7d092ee41af6b6e5be8f1c126398bd85f6df72e90ebaf44898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/planner/relation.rs:174-187 | src/frontend/src/planner/relation.rs:399-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/planner/relation.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaa5dc655019bbf5b17d39b13c3ff58f658fc6f19fc8405d0e17424060d3e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/stream_fragmenter/rewrite/delta_join.rs:156-169 | src/frontend/src/stream_fragmenter/rewrite/delta_join.rs:185-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/stream_fragmenter/rewrite/delta_join.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b1cf1833b71d0370db92bb081a4bd6a32df59d86459e649bc19c0ff61ffe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/frontend/src/handler/alter_database_param.rs:30-43 | src/frontend/src/handler/alter_database_param.rs:83-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_database_param.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"35686700c64f330c9a9a0902464fe841068877a93e3bfb0f16d0f50fa90a089b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/frontend/src/handler/alter_streaming_enable_unaligned_join.rs:30-42 | src/frontend/src/handler/describe.rs:277-290 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/handler/alter_streaming_enable_unaligned_join.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"52389b6419fd38988787a3e69e5df0de3142770b8f642753f3ecf8481953bb66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:669-682 | src/meta/src/controller/streaming_job.rs:732-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"925e20f2f53233c12629d6cc1becc48ea74c1fb10ad949529e329a5e115e3a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:1306-1319 | src/meta/src/controller/streaming_job.rs:1893-1906 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"521fad5917e63fd7e36c44b6051ba8f861d5c4cf55604a818df5b6aa8c0ef91b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:2811-2822 | src/meta/src/controller/streaming_job.rs:3800-3813 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"063a73035abca191c21f780a9dd898679592d20b8435c1de51ab90af042a7645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/dashboard/mod.rs:545-558 | src/meta/src/dashboard/mod.rs:611-624 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/dashboard/mod.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2255147c8e8ca1f1209a08958ce453c8fb91d2835a21469063fc2656dbe9dfb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/hummock/manager/time_travel.rs:478-491 | src/meta/src/hummock/manager/time_travel.rs:519-532 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"12991e35cbbcebad1347fad8396526c85bbf0d10ad22397a994c03ecdd34ebea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/manager/diagnose.rs:829-842 | src/meta/src/manager/diagnose.rs:884-897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/diagnose.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcda63f82d183111c0cbc734583fde4b35b8f686a21fb86d2ffa5f7bcd52519d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/rpc/election/sql.rs:201-214 | src/meta/src/rpc/election/sql.rs:551-564 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/rpc/election/sql.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0475dc71c7b93993716c6702e301f828609efc864ddc422fbbc6d70dbae85fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/stream/stream_manager.rs:950-963 | src/meta/src/stream/stream_manager.rs:994-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":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eca7bbdf539cf07b55235d77e04b04051cf8ddb64775538ee2265aaf68f685c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/backup_restore/utils.rs:42-55 | src/meta/src/backup_restore/utils.rs:59-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/backup_restore/utils.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7c40c930cc415d65274b42c1c5ae563512d3b68a5b1da62aaa1c4a2b2ef497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:52-65 | src/meta/src/controller/catalog/alter_op.rs:886-899 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae0124e293b1a320c8840af76aff410f38eb0fad14edde227d44c31548a0bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/object_store/src/object/mod.rs:608-621 | src/object_store/src/object/mod.rs:720-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":"src/object_store/src/object/mod.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e71616b1669f842e62ccf6ee026a075c5d0ce1674d01a63c1d412d7f00873a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/storage/src/hummock/sstable/writer.rs:229-242 | src/storage/src/hummock/sstable/writer.rs:335-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable/writer.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3626f0d52fe1f1b7d7b8abe425a98d6e8bc91bef613b3e2a889cb9cfe5bf5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/storage/src/mem_table.rs:222-235 | src/storage/src/mem_table.rs:308-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/mem_table.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"705ca7ce8a3cf00d61ac3eb02f3a96e2397244cfe52abcfb0cf5940a8dd78db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/common/table/state_table.rs:1318-1331 | src/stream/src/common/table/state_table.rs:1375-1388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd534c5200364be9ec6c55cb5a55d4a62887cd47b1ed657dfa13a9b4d2a72f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/common/table/state_table.rs:1982-1995 | src/stream/src/common/table/state_table.rs:2070-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a499ca26d679e35ecadebe3b251694af43aa3878534cbe896b22e59eabc1852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/asof_join.rs:461-474 | src/stream/src/executor/hash_join.rs:729-742 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03e8d4aa1b5800c45cf8cc523b9be57683402d3c6810d6e4c335180befc6aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/asof_join.rs:475-488 | src/stream/src/executor/hash_join.rs:748-761 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f7017b65a9414ec4881daaa160dc8c939061eddfd874b869c84b144c06aec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:295-308 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:667-683 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"01220c4ab47109aa1704d7b74b807fb1a67ef8ac4dd26b34be7678d6d909e836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs:412-425 | src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs:555-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":"src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"69502a71d65d5f817a8671a3b813a703a0b3ee1201733ea4c729b03e6034876c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/stream/src/executor/mview/cache.rs:223-235 | src/stream/src/executor/mview/cache.rs:290-303 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/mview/cache.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"440b4dd96fce4830ce696898163a54d488173a7b0a96c0781805cd266a118dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_iceberg_fetch.rs:267-280 | src/stream/src/executor/source/iceberg_fetch_executor.rs:329-342 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_iceberg_fetch.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca43d33846c46a4bb9bdaf3ded14f25d54cf05a64df97fd286059bfb2f27cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/source/fs_fetch_executor.rs:160-173 | src/stream/src/executor/source/iceberg_fetch_executor.rs:120-133 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/fs_fetch_executor.rs\u0060 and \u0060src/stream/src/executor/source/iceberg_fetch_executor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b56567ae28d19ba57861e1c0351ae492866c081d937279340276777d9be1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/source/fs_fetch_executor.rs:278-291 | src/stream/src/executor/source/iceberg_fetch_executor.rs:262-275 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/fs_fetch_executor.rs\u0060 and \u0060src/stream/src/executor/source/iceberg_fetch_executor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d30cff5969b9d4ba5a40769fb5f19b4f3091384184e43ea9c1dfbf97b155ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/temporal_join.rs:726-739 | src/stream/src/executor/temporal_join.rs:814-827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/temporal_join.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acb7df2bd9cf2d6b1db05604cc632fbd74732d3d173be6e3bb9090a259bd069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/batch/executors/src/executor/join/hash_join.rs:1259-1271 | src/batch/executors/src/executor/join/hash_join.rs:1321-1333 | src/batch/executors/src/executor/join/hash_join.rs:1438-1450 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"db99644e09751343f75a0d8543977c5bdd1b5a0c2a43553030b05c72be33fae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/frontend/src/optimizer/plan_node/logical_delete.rs:79-91 | src/frontend/src/optimizer/plan_node/logical_insert.rs:105-117 | src/frontend/src/optimizer/plan_node/logical_update.rs:82-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_delete.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c2ff8c91a3703953eace82944771918466d8e346155905d2b6f0fea5189662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/frontend/src/optimizer/rule/table_function_to_file_scan_rule.rs:44-56 | src/frontend/src/optimizer/rule/table_function_to_mysql_query_rule.rs:44-56 | src/frontend/src/optimizer/rule/table_function_to_postgres_query_rule.rs:45-57 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/rule/table_function_to_mysql_query_rule.rs\u0060 and \u0060src/frontend/src/optimizer/rule/table_function_to_postgres_query_rule.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/table_function_to_file_scan_rule.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e3edf5a221986c2e10c581164b2e8b36ec8dfa5bbfca2a93508d7a81c6a9ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/frontend/src/scheduler/local.rs:320-332 | src/frontend/src/scheduler/local.rs:363-375 | src/frontend/src/scheduler/local.rs:401-413 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/local.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b10f010a585389b79b8abfe0bf3570c21fc10dbb62a861e6004f05976210c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): src/frontend/src/session.rs:1055-1067 | src/frontend/src/session.rs:1112-1123 | src/frontend/src/session.rs:1132-1144 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/session.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f32bab725404cd593041a07e6f9a9c6d3c2a31b9d049ee8819a56dc7628683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/frontend/src/handler/create_aggregate.rs:91-103 | src/frontend/src/handler/create_function.rs:141-153 | src/frontend/src/handler/create_sql_function.rs:121-133 \u2014 before extracting anything, compare \u0060src/frontend/src/handler/create_aggregate.rs\u0060 and \u0060src/frontend/src/handler/create_function.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_aggregate.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9d279f8106c14a4e625d885b2ab4554a6d1687d03327eb0351065e558e79b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/meta/src/rpc/election/sql.rs:223-235 | src/meta/src/rpc/election/sql.rs:398-410 | src/meta/src/rpc/election/sql.rs:573-585 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/meta/src/rpc/election/sql.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc7f37574a83c9b097bf47e14242978d638ce639813444908e8f8093814ab26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): src/meta/src/controller/catalog/alter_op.rs:51-60 | src/meta/src/controller/catalog/alter_op.rs:850-859 | src/meta/src/controller/catalog/alter_op.rs:882-894 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dc33252489e67ced64aad31a59c0b55c7dceacb875429839bc5c379f71214a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:503-515 | src/batch/executors/src/executor/order_by.rs:134-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff52838588240be1f0a88bad871bc8399c8b449ac1493e320744ebeb1cdc3ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:742-754 | src/batch/executors/src/executor/join/lookup_join_base.rs:212-224 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c1a7d128f5c1a9845cb3590474d397e6e2c2c953e147429a2522fba322cbaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/batch/executors/src/executor/join/nested_loop_join.rs:311-323 | src/batch/executors/src/executor/join/nested_loop_join.rs:499-511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/nested_loop_join.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e52a91cc9b784ff80ce0355ca9b33c4cbb0602f6392ff76af6c5cae94a93e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/batch/executors/src/executor/join/nested_loop_join.rs:381-393 | src/batch/executors/src/executor/join/nested_loop_join.rs:425-437 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/nested_loop_join.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"030cb5ce066c64807c20d52a94d8e33fd119217fdb6ed49499c99e9a89af3129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/common/src/types/to_binary.rs:104-116 | src/common/src/types/to_binary.rs:127-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/types/to_binary.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0fb57a6dc8ec30b2ba7773aa62fef4b2521bd57e5cf6347d134cb9bf321e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_config.rs:258-270 | src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_config.rs:272-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_config.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"29de47f0766ec9020525b63734af7e7df6262e275e70a5f8acf2e4b3cb8ae55c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/connector/src/sink/iceberg/writer.rs:377-389 | src/connector/src/sink/iceberg/writer.rs:511-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"593455a20632bdae8d631d5f0f1c0a4e6b9f55e55fae8d78784b9030d3c7151d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/connector/src/sink/snowflake_redshift/snowflake.rs:1181-1193 | src/connector/src/sink/snowflake_redshift/snowflake.rs:1204-1214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/snowflake_redshift/snowflake.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b145134189811840b07bc2558313743c02769c719d3818f65c2322f147acfe4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/connector/src/source/cdc/external/postgres.rs:403-415 | src/connector/src/source/cdc/external/postgres.rs:694-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":"src/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b216cd971bc61a0936b33bbe06ddbf6d1df7fa5dc504fdf30d53b447581016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/frontend/src/binder/relation/mod.rs:296-308 | src/frontend/src/binder/relation/mod.rs:352-363 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/binder/relation/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e364f639f068ead3c1abfc716d396362eff73684c57dd29658186b1e3df02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/frontend/src/binder/select.rs:459-470 | src/frontend/src/binder/select.rs:503-515 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/binder/select.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf5d3850b34e3f50bfc6df9d38a606d782b95e72d988c25159ee2e5a7245dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs:100-112 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs:92-104 \u2014 before extracting anything, compare \u0060src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs\u0060 and \u0060src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3ff987c91e93fd2d72220939b6d44317c7731b7451345cab6b6c931e755ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:48-60 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:93-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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac80ff65badf3c1f4942b2d1f275b335487a28751deadc14f76095459322096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/metrics_reader.rs:126-138 | src/meta/src/dashboard/mod.rs:897-909 \u2014 before extracting anything, compare \u0060src/frontend/src/metrics_reader.rs\u0060 and \u0060src/meta/src/dashboard/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/metrics_reader.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d3de9dc30f6bb16aec93f819a0049fe795cb0c4c160878dda2da90af3bdf44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_cdc_table_scan.rs:166-178 | src/frontend/src/optimizer/plan_node/stream_source_scan.rs:108-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_cdc_table_scan.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"241a8159c97adddd73a8667fb44aeda916022623fc5f493c4308853594e6ed1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_eowc_gap_fill.rs:150-162 | src/frontend/src/optimizer/plan_node/stream_gap_fill.rs:143-155 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/stream_eowc_gap_fill.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_gap_fill.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":"src/frontend/src/optimizer/plan_node/stream_eowc_gap_fill.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3573101800db97621cafc63379699375d6757b8069ce672a8c9dda5c9c74445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_materialize.rs:689-701 | src/frontend/src/optimizer/plan_node/stream_vector_index_write.rs:243-253 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_materialize.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7c3395ae53cf152598fb8ecb87304c95afb577628119b25a993f633135be3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:350-362 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:510-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"905f5cf184b4404a7603012f1ecdd63194da9726a8c0ef9121710aec387fde27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/optimizer/rule/except_to_anti_join_rule.rs:26-38 | src/frontend/src/optimizer/rule/intersect_to_semi_join_rule.rs:28-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/rule/except_to_anti_join_rule.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1123ed270e01c4d708133f0e310e9b51f39c9572bf8ec1678bbeca9efff05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/frontend/src/handler/alter_connection_props.rs:48-60 | src/frontend/src/handler/alter_sink_props.rs:58-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_connection_props.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5059c5f5644bff01bf8c8583c7c8bc8f6fa227f3a3b6afb7662cd36a434360b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/frontend/src/handler/alter_streaming_enable_unaligned_join.rs:61-72 | src/frontend/src/handler/describe.rs:309-321 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/handler/alter_streaming_enable_unaligned_join.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf3923b32b15d81e71b15c2e57d47c094ddf869f0feed4fc675ef74967be0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/java_binding/src/lib.rs:56-68 | src/jni_core/src/jvm_runtime.rs:161-173 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/java_binding/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcc0d7b7818e48a0b0e0d439f3410a0f86beab54aaa76a38817f1717eff30a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs:14-26 | src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs:33-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":"src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1196acd3f891f7c8bae9b68f194701a52cefad9122717edcbe3efab2bedeb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/meta/service/src/ddl_service.rs:1579-1591 | src/meta/service/src/ddl_service.rs:1602-1614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f8dfb70665fa130749ca34d45e0a93873da3158f522333ab691cc923839ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:596-608 | src/meta/src/controller/streaming_job.rs:769-781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e7cee2e2ab3d7bafbc0dd810fbd956005ccc864c6b530d2a0e34f426aa773e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:1403-1415 | src/meta/src/controller/streaming_job.rs:2451-2463 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e3e9bff619a61feff0718a948b5d27b47d1d29ec85ee6a1cd60d65535ec79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:2877-2889 | src/meta/src/controller/streaming_job.rs:3504-3514 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f7771a3c3601a38bfd06095c80776ed6d4daefc98eb5dc73940a3027b5a085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:3353-3365 | src/meta/src/controller/streaming_job.rs:3400-3412 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb7b365e6a9ff28b2747e5aabc414530772b8438cd9de0df38a3007b6722b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/sqlparser/src/ast/mod.rs:3065-3077 | src/sqlparser/src/ast/query.rs:419-430 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/sqlparser/src/ast/mod.rs"},"region":{"startLine":3065}}}],"partialFingerprints":{"codehealthFindingId/v1":"73581c6d668ff7adbab66a9cf4a9947cf3de51d163c3117bb83fce578feb6831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/sqlparser/src/parser.rs:2895-2907 | src/sqlparser/src/parser.rs:3010-3022 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/parser.rs"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"2335ac7c70bf9625f7f61d17462740a2018287619ef06d7c84cb0ef24193c12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/storage/src/hummock/store/local_hummock_storage.rs:848-860 | src/storage/src/hummock/store/local_hummock_storage.rs:930-942 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/hummock/store/local_hummock_storage.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"457804ad695a465baaa7e934682f3cde3f5f5505f8a2be4e2b56d513689138e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/storage/src/memory.rs:165-175 | src/storage/src/memory.rs:197-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/memory.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d25da69494c899d1580d0ed9506a35f1b73fefa00e05ae1094515c417c64348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/stream/src/executor/asof_join.rs:233-245 | src/stream/src/executor/hash_join.rs:402-414 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8dd410fa655b7d5e2742c14a42a1b47c98348b9ff8f16ed6cbb8112f78265a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/stream/src/executor/backfill/cdc/upstream_table/snapshot.rs:181-193 | src/stream/src/executor/backfill/cdc/upstream_table/snapshot.rs:275-287 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/backfill/cdc/upstream_table/snapshot.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fde35be5f4c530dab66e43fd089c9fa0045880f91e0cd3ef3971a3f182c0d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): src/stream/src/executor/join/asof_join.rs:602-610 | src/stream/src/executor/join/asof_join.rs:632-644 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/join/asof_join.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ade158b1eaf19fc25317f06926af46cbde12ebd86bb4675e5fea499cea608f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/stream/src/executor/over_window/range_cache.rs:233-245 | src/stream/src/executor/over_window/range_cache.rs:279-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/range_cache.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb615b5d41db46686587ca9e1793eccc2ee4679ade25152ef405b21a7ba1de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs:167-179 | src/stream/src/executor/source/batch_source/batch_iceberg_fetch.rs:344-356 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"990b598b8a90d6d3261e1b679ed93c6aab134a606367d652ee487e40a230a1a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs:155-167 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:179-191 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_iceberg_list.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"645a109db180d093d6831ccefdf9010f57144b5dabca459389cfb28fd63ffffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/stream/src/from_proto/mview.rs:100-112 | src/stream/src/from_proto/mview.rs:119-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":"src/stream/src/from_proto/mview.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0c72ae8e666d253ff73ba98822fdcde922e794f12aa76be32983bb52ba5e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/stream/src/from_proto/temporal_join.rs:93-105 | src/stream/src/from_proto/temporal_join.rs:177-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":"src/stream/src/from_proto/temporal_join.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dc8393158e6977e64c19db58926c5db617e4daaea4affbba5c9bfa244a6243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs:92-103 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:75-86 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:164-175 | src/stream/src/executor/source/batch_source/batch_posix_fs_list.rs:208-219 | src/stream/src/executor/source/fs_list_executor.rs:106-117 | src/stream/src/executor/source/iceberg_list_executor.rs:93-104 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_iceberg_list.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_list.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fc11e0ae40db1e5440d9d665fc74944caeb679c91edeaa522e8e8fd7c3b4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): src/frontend/src/catalog/system_catalog/rw_catalog/rw_connections.rs:38-49 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_functions.rs:42-53 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_materialized_views.rs:44-55 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_secrets.rs:34-45 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_tables.rs:41-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_connections.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c113860566c2463096bf21d54b5509ce43d7e7f6a0e19201087d79c0498348b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): src/frontend/src/catalog/system_catalog/rw_catalog/rw_internal_tables.rs:40-51 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_sinks.rs:53-63 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_sources.rs:55-65 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_subscriptions.rs:41-52 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_views.rs:37-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_internal_tables.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f9c3f703a0449e4f226b3b13a468b1eee3603fc0c9439f3aa991adefe724cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/frontend/src/metrics_reader.rs:103-114 | src/frontend/src/metrics_reader.rs:132-143 | src/meta/src/dashboard/mod.rs:876-887 | src/meta/src/dashboard/mod.rs:903-914 \u2014 before extracting anything, compare \u0060src/frontend/src/metrics_reader.rs\u0060 and \u0060src/meta/src/dashboard/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/metrics_reader.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c303aae4c63553cf1fec394d4d986528085de4e64633c3ee770fae11ddbb589b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/frontend/src/optimizer/plan_node/logical_dedup.rs:200-211 | src/frontend/src/optimizer/plan_node/logical_gap_fill.rs:127-138 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:283-294 | src/frontend/src/optimizer/plan_node/logical_topn.rs:269-280 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_dedup.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"da05545fd7d826682f8a764b342a368652793a6b518a3f3d1cb6038e108771a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201312 lines \u00D7 4): src/frontend/src/optimizer/plan_node/stream_dml.rs:36-41 | src/frontend/src/optimizer/plan_node/stream_iceberg_with_pk_index_position_delete_merger.rs:50-55 | src/frontend/src/optimizer/plan_node/stream_sink.rs:216-227 | src/frontend/src/optimizer/plan_node/stream_sync_log_store.rs:40-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 all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_dml.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a820faae2bc53f2d0ea96dad6b2a23e2ec1737f878453342d6a71fc27cd570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/batch/executors/src/executor/delete.rs:179-190 | src/batch/executors/src/executor/insert.rs:190-201 | src/batch/executors/src/executor/update.rs:214-225 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/batch/executors/src/executor/delete.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eafcced6695ec0c9744c35bf355f0eab01ebf4b6fecd5faca36fe8ae46bdf32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/batch/executors/src/executor/hop_window.rs:152-163 | src/expr/core/src/expr/test_utils.rs:97-108 | src/stream/src/executor/hop_window.rs:84-95 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hop_window.rs\u0060 and \u0060src/stream/src/executor/hop_window.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"src/batch/executors/src/executor/hop_window.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86117f4f6a0986a2211444a5c13160f73cc3b044a53d7754f249dcd6343e54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/compute/src/server.rs:516-527 | src/storage/compactor/src/server.rs:370-381 | src/storage/compactor/src/server.rs:479-491 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/server.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25be63b6e837832a0579b5f50eae64035ffa4f4214778ad17d77edd4668849d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/frontend/src/handler/show.rs:988-999 | src/frontend/src/handler/show.rs:1062-1072 | src/frontend/src/handler/show.rs:1132-1142 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/handler/show.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"7725a8dc25b7e61b0d031c3fedb827d5a353c54479d48ceaa96c82df711b8882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/frontend/src/optimizer/plan_node/logical_agg.rs:1310-1321 | src/frontend/src/optimizer/plan_node/logical_filter.rs:149-160 | src/frontend/src/optimizer/plan_node/logical_over_window.rs:577-588 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_agg.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_over_window.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"94973a73d4b66159cda52d9e54a16e261db6e5bf215659aa903bd2e0257109c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/frontend/src/optimizer/rule/table_function_to_file_scan_rule.rs:31-42 | src/frontend/src/optimizer/rule/table_function_to_mysql_query_rule.rs:30-41 | src/frontend/src/optimizer/rule/table_function_to_postgres_query_rule.rs:31-42 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/rule/table_function_to_mysql_query_rule.rs\u0060 and \u0060src/frontend/src/optimizer/rule/table_function_to_postgres_query_rule.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/table_function_to_file_scan_rule.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabeee8808bbc97a445e6d0941423f01d55ee34d4629e3c1682438b7be32cb22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/meta/src/controller/catalog/alter_op.rs:52-63 | src/meta/src/controller/catalog/alter_op.rs:306-317 | src/meta/src/controller/catalog/alter_op.rs:886-897 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c3fabe11c15af589f685726ba0889a50c798ef92d99c2c903e135162ac1d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/storage/src/mem_table.rs:180-191 | src/storage/src/mem_table.rs:246-257 | src/storage/src/mem_table.rs:348-359 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/storage/src/mem_table.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f88dcc093e6c10512f6394e038ae9d7c3af3ff4632d2d9429070ecb0449e524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/stream/src/executor/over_window/over_partition.rs:1012-1022 | src/stream/src/executor/over_window/over_partition.rs:1044-1055 | src/stream/src/executor/over_window/over_partition.rs:1088-1099 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"3612fac9433382678fa37e752218c4fd5de160fec33553c791db1d51880da086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/batch/executors/src/executor/aggregation/orderby.rs:136-147 | src/frontend/src/datafusion/aggregate/orderby.rs:137-148 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/aggregation/orderby.rs\u0060 and \u0060src/frontend/src/datafusion/aggregate/orderby.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/aggregation/orderby.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afb467f7e06091ecf4b4d0fd71af50b775df00f6346d4b005a5a556147d29c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:1255-1266 | src/batch/executors/src/executor/join/hash_join.rs:1504-1515 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb5c505d83bfe9cc81a26248505b80228cb91d636e5e99f51acb09466cc44dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/common/src/util/scan_range.rs:147-158 | src/common/src/util/scan_range.rs:199-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/scan_range.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6aa41b0f2f96034698bfe8e82e1c97313b11443d49dda6ef3235cf47773fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/connector/src/sink/dynamodb.rs:166-177 | src/connector/src/sink/dynamodb.rs:262-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/dynamodb.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6c4fceed32d1dd888f112ad9aa474f91ca9906fd375f4def6f1875e1d2e7b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/connector/src/source/nexmark/source/combined_event.rs:228-238 | src/connector/src/source/nexmark/source/combined_event.rs:276-287 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/source/nexmark/source/combined_event.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"627a1802d69882b2b6869054be084491a56f48a8b2aadbaaf244862067897226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/ctl/src/cmd_impl/hummock/compaction_group.rs:220-231 | src/ctl/src/cmd_impl/hummock/compaction_group.rs:252-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":"src/ctl/src/cmd_impl/hummock/compaction_group.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9b2c7c5d68bddb4b78499c0a6508549694838db7f52ff7b7318968c5407aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/expr/impl/src/scalar/to_char.rs:102-113 | src/expr/impl/src/scalar/to_char.rs:158-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":"src/expr/impl/src/scalar/to_char.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ccbe7c7a8e8c7e9612bc5236b0d5cac7b71c288cb58c47901bd448fbab85e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/expr/impl/src/scalar/jsonb_delete.rs:315-326 | src/expr/impl/src/scalar/jsonb_delete.rs:348-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/jsonb_delete.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3451041ec12baab8e45e11fbe6eb2f1018e98a0a2de6085f1f1d9ad5dc74e904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/expr/mod.rs:712-723 | src/frontend/src/expr/mod.rs:728-739 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/expr/mod.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe53d3d7c76d1c5e139628a7377e8b530223ccf39b881314329cbe18fee898b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/join.rs:230-241 | src/frontend/src/optimizer/plan_node/stream_asof_join.rs:165-176 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a69e63ee54b9fc898a2da67dbe0aaa8a028be51b22a6847cb8bf7b8ecccfba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 3): src/frontend/src/optimizer/plan_node/generic/filter.rs:70-73 | src/frontend/src/optimizer/plan_node/generic/join.rs:405-416 | src/frontend/src/optimizer/plan_node/logical_multi_join.rs:274-285 \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":"src/frontend/src/optimizer/plan_node/generic/filter.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde9161feb2e2299fca74c92a16634c94fa0435772fa2151bc90a68ed2d74dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_project.rs:415-426 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:446-457 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_project.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_project_set.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_project.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"396442403f9b77de4f6de6bab273ab67aa468e07447c142c1776099040c636b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/optimizer/plan_node/utils.rs:384-395 | src/frontend/src/optimizer/plan_node/utils.rs:435-446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/utils.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a3f7e84b743868c12750ea6f65f64c9746fda90b8ab3148091ab0f4d21fafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/handler/create_database.rs:71-82 | src/frontend/src/handler/create_schema.rs:65-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_database.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fc627e9604384854694b5474669631c66c0c2d0ef42097acee01d1a94f92eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/binder/expr/function/mod.rs:304-315 | src/frontend/src/binder/expr/function/mod.rs:354-365 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/binder/expr/function/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1759f16b27f90d2be7ea38d1ecf4b53020964425f515d481b4dc751e931d1898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/jni_core/src/lib.rs:1209-1220 | src/jni_core/src/lib.rs:1284-1295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jni_core/src/lib.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f260afddf0877e0469de27c66d933cb3489a67c1703d5ebd9a7d1d3a54ae33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/meta/service/src/ddl_service.rs:1934-1945 | src/meta/service/src/ddl_service.rs:1984-1995 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/service/src/ddl_service.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"801315770d290c3226a3132e032f35877550957cd0f7d4f85b8373cbd0b1fd04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:4063-4073 | src/meta/src/controller/streaming_job.rs:4132-4143 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":4063}}}],"partialFingerprints":{"codehealthFindingId/v1":"9651fb0eb188296cbf8979750e1e8f2ce1b82be8049253ac9fc8c8f3510b86a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/sqlparser/src/ast/mod.rs:729-740 | src/sqlparser/src/ast/mod.rs:743-754 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/ast/mod.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceaca5846a926b59a2298806a1d86eddf6e3057295f485bf612c95b36be92d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/storage/src/monitor/traced_store.rs:190-201 | src/storage/src/monitor/traced_store.rs:210-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/monitor/traced_store.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1737eaed887d1b1b098881b9b4190f23b9928ce061c6bc75481aaadb4601fe7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/storage/src/monitor/traced_store.rs:374-385 | src/storage/src/monitor/traced_store.rs:394-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/monitor/traced_store.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebebd0a73031a0f18f25cd501133fbd32ba8ab41268fd7d8dae10952cf6d798c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/common/log_store_impl/kv_log_store/serde.rs:653-664 | src/stream/src/common/log_store_impl/kv_log_store/serde.rs:684-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/log_store_impl/kv_log_store/serde.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78877e1ce709f2c3bc90d8179b0b5ed03851b991797b74ca15688e4d4260e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/common/table/state_table.rs:2009-2020 | src/stream/src/common/table/state_table.rs:2098-2109 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/common/table/state_table.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3172ee2789eab6e5e972d1badb834f9cd16d2cecd725272b0b01a891c02f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/aggregate/agg_group.rs:478-489 | src/stream/src/executor/aggregate/agg_group.rs:552-563 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/aggregate/agg_group.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3d7c13d944297d1d4ea971b69d0a79c1eb577ecf17ed046bc0ee865907a2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/aggregate/hash_agg.rs:463-474 | src/stream/src/executor/aggregate/hash_agg.rs:480-491 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/aggregate/hash_agg.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"842a78c65aa0f11fd07f0f1778c24b246e96271428a52ccd03c73b15ade3c902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/stream/src/executor/asof_join.rs:206-216 | src/stream/src/executor/hash_join.rs:349-360 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c721d7b9142d76c6e08f0e91d275b6d79a9478e42690be8840122c7d8c97a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/join/asof_join.rs:399-410 | src/stream/src/executor/join/asof_join.rs:425-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/join/asof_join.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0a24b395edac4ccffe7c1858fe54cd92d3edb56af3907a8cc13e16c5fbf264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/locality_provider.rs:676-687 | src/stream/src/executor/locality_provider.rs:708-719 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/locality_provider.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9469ae338136097e91d1b15643ca7f65e0bea0b7f2e8f3787a6c409aebb133f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/over_window/range_cache.rs:247-258 | src/stream/src/executor/over_window/range_cache.rs:294-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/range_cache.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"695d211a4bea89c4b3856d6fa8ea663b0d4a75eacea86f6731d00bdd57bb83a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:229-240 | src/stream/src/executor/source/source_executor.rs:856-867 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5305b215dba38e87376cf591f94253c31c262b58b95691cbcd408284f36dc9b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/source/fs_fetch_executor.rs:423-434 | src/stream/src/executor/source/fs_fetch_executor.rs:494-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/fs_fetch_executor.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da51fc003ec01bf14978bb48249f4db892f8b29afb9219efc97dafa034dad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/utils/pgwire/src/ldap_auth.rs:531-542 | src/utils/pgwire/src/ldap_auth.rs:581-592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/ldap_auth.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b76a07374ae9e68cf86a6bff59368fb716e32ea915ebb64ac054a885237a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 11): src/connector/src/sink/big_query.rs:282-292 | src/connector/src/sink/clickhouse.rs:383-393 | src/connector/src/sink/doris.rs:116-126 | src/connector/src/sink/file_sink/azblob.rs:113-123 | src/connector/src/sink/file_sink/fs.rs:82-92 | src/connector/src/sink/file_sink/gcs.rs:98-108 | src/connector/src/sink/file_sink/s3.rs:142-152 | src/connector/src/sink/file_sink/webhdfs.rs:87-97 | src/connector/src/sink/mongodb.rs:169-179 | src/connector/src/sink/postgres.rs:154-164 | src/connector/src/sink/sqlserver.rs:86-96 \u2014 before extracting anything, compare \u0060src/connector/src/sink/doris.rs\u0060 and \u0060src/connector/src/sink/sqlserver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/big_query.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebfaf696b351196bd94b9cfe73f9f50f3f4dd69c91f0383140d86ed2f64ed76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/batch/executors/src/executor/join/hash_join.rs:967-977 | src/batch/executors/src/executor/join/hash_join.rs:1318-1328 | src/batch/executors/src/executor/join/hash_join.rs:1435-1445 | src/batch/executors/src/executor/join/hash_join.rs:1584-1594 \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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b288db2bd00723579df8fda17473b9ebfafffb9dbccf3bd1df913f9489322fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/common/src/array/arrow/arrow_iceberg.rs:131-141 | src/common/src/array/arrow/arrow_iceberg.rs:501-511 | src/common/src/array/arrow/arrow_impl.rs:362-372 \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":"src/common/src/array/arrow/arrow_iceberg.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfe684d4456498c11f5b53e55fe76844cb41a5c11b20630d69b12783f8ba1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): src/expr/core/src/aggregate/user_defined.rs:157-166 | src/expr/core/src/expr/expr_udf.rs:175-185 | src/expr/core/src/table_function/user_defined.rs:129-138 \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":"src/expr/core/src/aggregate/user_defined.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20260e1a4dd2f4a9f8e50d18cdcd4f0e02be43f19e241d504d1fdcf63619455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/expr/impl/src/udf/wasm.rs:59-69 | src/expr/impl/src/udf/wasm.rs:147-157 | src/expr/impl/src/udf/wasm.rs:186-196 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/expr/impl/src/udf/wasm.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"221e13724eaf25267f8e19e25a9c2f6c6b29063ef9f7689f032e0a45e376ce64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/frontend/src/optimizer/plan_node/batch_delete.rs:69-79 | src/frontend/src/optimizer/plan_node/batch_insert.rs:81-91 | src/frontend/src/optimizer/plan_node/batch_update.rs:72-82 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/optimizer/plan_node/batch_delete.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d547b61449912512658c15b3657fdcf1a81c49c38fc6a4a9f6b5daa9f1a0f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/frontend/src/utils/overwrite_options.rs:37-47 | src/frontend/src/utils/overwrite_options.rs:50-60 | src/frontend/src/utils/overwrite_options.rs:63-73 | src/frontend/src/utils/overwrite_options.rs:74-85 \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":"src/frontend/src/utils/overwrite_options.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e529993bc6e71c9b463eedbdcf2e521db03932f32511bc92443324a709a5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/frontend/src/handler/alter_set_schema.rs:84-94 | src/frontend/src/handler/alter_set_schema.rs:100-111 | src/frontend/src/handler/alter_set_schema.rs:117-128 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/handler/alter_set_schema.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd1b752a8532af27514c18eb2e67e92086f5e8b20ba12875c1a49cca80ef108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): src/meta/src/hummock/compaction/selector/space_reclaim_selector.rs:57-67 | src/meta/src/hummock/compaction/selector/tombstone_compaction_selector.rs:58-68 | src/meta/src/hummock/compaction/selector/ttl_selector.rs:54-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/compaction/selector/space_reclaim_selector.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dd0a1c6c453422861a5081599528884e339c510f2e03e185e7ac4548f5a599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/meta/src/hummock/manager/compaction/compaction_group_manager.rs:302-312 | src/meta/src/hummock/manager/compaction/compaction_group_schedule/normalize.rs:203-213 | src/meta/src/hummock/manager/versioning.rs:319-329 \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":"src/meta/src/hummock/manager/compaction/compaction_group_manager.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"db04a1e40367670b6c3cbfb1112cf71d055767aeadeb81b2124b9ac846fe0428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): src/stream/src/executor/backfill/arrangement_backfill.rs:341-349 | src/stream/src/executor/backfill/arrangement_backfill.rs:394-402 | src/stream/src/executor/locality_provider.rs:656-666 \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":"src/stream/src/executor/backfill/arrangement_backfill.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"28730709ab65ac719b055dc8ec1bcc387a55680e389680ef5c530f84969af11a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/stream/src/from_proto/lookup.rs:77-87 | src/stream/src/from_proto/temporal_join.rs:95-105 | src/stream/src/from_proto/temporal_join.rs:179-189 \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":"src/stream/src/from_proto/lookup.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcb01ba26fd8fbd69bd4d60828e13f5c0303ef99ba1110440e8b85ad0fa3777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/batch/executors/src/executor/hop_window.rs:180-190 | src/stream/src/executor/hop_window.rs:142-152 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hop_window.rs\u0060 and \u0060src/stream/src/executor/hop_window.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"src/batch/executors/src/executor/hop_window.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccfc4ee21ffe233d95a8ab858fd83c57dfde5c122a09f1cb2afbd7c4f201944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/batch/executors/src/executor/join/distributed_lookup_join.rs:265-275 | src/batch/executors/src/executor/join/local_lookup_join.rs:476-486 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/batch/executors/src/executor/join/distributed_lookup_join.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a6223da3500de9222ef7ae5bf762cad78a9482e8743eb8e515e4adf7e8c973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/batch/executors/src/executor/join/nested_loop_join.rs:293-303 | src/batch/executors/src/executor/join/nested_loop_join.rs:468-478 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/nested_loop_join.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d32f9cf4c80dadc2e39b9ebd0925ebef2932faaf0e19c62231b99d58aa184af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/common/src/util/scan_range.rs:176-184 | src/common/src/util/scan_range.rs:214-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/scan_range.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d69a8d8bac3c0598ab8d9d1de615270450634ce27e02674d066536d2e6d65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/connector/src/sink/catalog/mod.rs:458-468 | src/connector/src/sink/mod.rs:370-380 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/connector/src/sink/catalog/mod.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddb5ee429e91a9e4e4074b33e81a7321896012ef6b609f68d25a2cd1fa8e243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/connector/src/sink/iceberg/writer.rs:411-421 | src/connector/src/sink/iceberg/writer.rs:627-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7315347499d1d3172dd34279bda23dac104ed33bcf4a34f242ec508f5c8b6789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/connector/src/source/cdc/external/postgres.rs:443-453 | src/connector/src/source/cdc/external/postgres.rs:454-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":"src/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7907864f038ba730b83cce7e4a3c802f905be17fdc22ad3f05e6ac4e1d9bae79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/binder/expr/function/mod.rs:958-968 | src/frontend/src/binder/select.rs:362-372 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/binder/expr/function/mod.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8aa0ada4b6af8c7885f18681bff84ffc83383ea71c7d64c676c99e53e9e54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/expr/mod.rs:549-559 | src/frontend/src/expr/mod.rs:572-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/mod.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3fa93989149acefba846cca3346c3d4ea1cbc399c8c43e959108860f51c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/frontend/src/handler/create_mv.rs:401-410 | src/frontend/src/handler/create_sink.rs:522-532 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/handler/create_mv.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8564381f8405a007f42de641f6ba6c3b0ec2b1de6d777e1f6532af45b9a46a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/handler/explain_analyze_stream_job.rs:224-234 | src/frontend/src/handler/explain_analyze_stream_job.rs:240-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":"src/frontend/src/handler/explain_analyze_stream_job.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e97a0a2228cd82c46005703770d9c2927c5154620011156141805466437d05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/monitor/stats.rs:215-225 | src/meta/src/rpc/metrics.rs:1686-1696 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/monitor/stats.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bea01cacb7553ce0bc5a584acdb848ec4655bb13d5406506f33f3393628430f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/optimizer/delta_join_solver.rs:344-354 | src/frontend/src/optimizer/delta_join_solver.rs:369-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/delta_join_solver.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf2d8179205905375c8a4f555a5585906299a33a2d20514e15d2fc277d3600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/join.rs:257-265 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:389-399 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e324d196239294a5a7b55ac80bcbf637ad5fe9ef74f089fa380e7db04d2344b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_project.rs:125-135 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:212-222 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_project.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_project_set.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_project.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3755f2491baee36793092859dd494beced09b71bb087f954ac3c7dc36d545461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_project.rs:155-165 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:255-265 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_project.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_project_set.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_project.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb4960965efa63d6a22fe0151496cc4d36f3ad492284124500d62820b37f2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_asof_join.rs:212-222 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:536-546 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_asof_join.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a8be0535b50931b0714f6ac1e943a2753674d1ed7eab8ed5259a61c761857f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_eowc_gap_fill.rs:177-187 | src/frontend/src/optimizer/plan_node/stream_gap_fill.rs:175-185 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/stream_eowc_gap_fill.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_gap_fill.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":"src/frontend/src/optimizer/plan_node/stream_eowc_gap_fill.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1665afaa9f03b580b83a36a73132b65e9587aceccc3af694a7ddb97ab825a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:369-379 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:540-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9710e4fda586137d7e24727b1a8201229f006ca70a74647e18f83de2708f081f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/optimizer/rule/min_max_on_index_rule.rs:116-126 | src/frontend/src/optimizer/rule/min_max_on_index_rule.rs:186-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":"src/frontend/src/optimizer/rule/min_max_on_index_rule.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20f53684d12bdbc3773b5ae3daadb8546cbc31464c284f4ff836b4cfa79ec36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/frontend/src/optimizer/rule/pull_up_correlated_predicate_agg_rule.rs:97-106 | src/frontend/src/optimizer/rule/pull_up_correlated_predicate_rule.rs:67-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/rule/pull_up_correlated_predicate_agg_rule.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7436b38bfa9c2eac3c6fa298f5498c6589cfb34a6b8a3f6bb0d537fff54ee857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/handler/alter_set_schema.rs:56-66 | src/frontend/src/handler/alter_set_schema.rs:70-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_set_schema.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeaa69a577ccd438be9e8ddd357fb13649812921dca09bc1cbaf912063cc4c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/stream_fragmenter/rewrite/delta_join.rs:293-303 | src/frontend/src/stream_fragmenter/rewrite/delta_join.rs:305-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/stream_fragmenter/rewrite/delta_join.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8a7bb94bb56bb9a2e04b22f6ad5270aab3fb8cbe63e7b0dcc97606ac616a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/meta/node/src/server.rs:520-530 | src/meta/node/src/server.rs:562-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/node/src/server.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6af4159e3ec42e0c73f380a134626d2406b065b036e4e4674d3ea08eff2ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/meta/src/barrier/checkpoint/control.rs:890-899 | src/meta/src/barrier/checkpoint/control.rs:904-914 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"8504ea1a82b41d8ae21cf58bc5bf1f3f744c63ce63ce3294bae887421d149840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/meta/src/controller/fragment.rs:735-745 | src/meta/src/controller/fragment.rs:746-756 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/fragment.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aac02b9e2fd7bbc1735645e1d5876bc64cdaa4d57518495e902ce309098003c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/meta/src/controller/fragment.rs:1685-1695 | src/meta/src/controller/scale.rs:124-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/fragment.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"affc8148d3c1d9e9467a525b1e82ed6125601480fc473cecf2123c626abde17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/meta/src/hummock/manager/timer_task.rs:303-313 | src/meta/src/hummock/manager/timer_task.rs:322-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":"src/meta/src/hummock/manager/timer_task.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9cf03951f991a0f229eeb776d66862bbf2aa2cf47e22c2da941e9748f099db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/risedevtool/src/task/meta_node_service.rs:151-161 | src/risedevtool/src/task/meta_node_service.rs:175-185 \u2014 both copies are in the same file, so extract the block into one function there 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/risedevtool/src/task/meta_node_service.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c5f1fff9f449e7b68b9e4ad77a97cfb0b0ab7987c6c27b4829521eea3d49bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/sqlparser/src/parser.rs:2170-2180 | src/sqlparser/src/parser.rs:2645-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":"src/sqlparser/src/parser.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9aa00f3c366ef5ded6e1eb23c581b60b47136267d21871a3be86fd47c5c6cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/storage/src/table/batch_table/mod.rs:347-357 | src/stream/src/common/table/state_table.rs:1098-1107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/storage/src/table/batch_table/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be2a537648179d9f535a970b2ceec1230cb8a85c5f410c9eeae94c22904747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/common/table/state_table.rs:1997-2007 | src/stream/src/common/table/state_table.rs:2085-2095 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/common/table/state_table.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb89704a241e9463f58c6abff34b31942b68242c45f8f40ff8b8602528bafeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/executor/asof_join.rs:221-231 | src/stream/src/executor/hash_join.rs:385-395 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed48a7374fbd296c84b22b4e308d1adc9f4f569edef916c430f52c2f458b48a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/executor/asof_join.rs:542-552 | src/stream/src/executor/hash_join.rs:827-837 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fae3d49a04d94fcc4938a43a09a4ff7daf9a0c7613ab8e84e49322ff0554d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/stream/src/executor/backfill/cdc/cdc_backfill.rs:341-351 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:118-127 \u2014 before extracting anything, compare \u0060src/stream/src/executor/backfill/cdc/cdc_backfill.rs\u0060 and \u0060src/stream/src/executor/backfill/cdc/cdc_backill_v2.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"de57dcd8b41de62c5801fb58205ca6c25fa7f006cfa20ae1eddd55b03f194ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/executor/backfill/cdc/cdc_backfill.rs:689-699 | src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs:459-469 \u2014 before extracting anything, compare \u0060src/stream/src/executor/backfill/cdc/cdc_backfill.rs\u0060 and \u0060src/stream/src/executor/backfill/cdc/cdc_backill_v2.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f1b3189ebd908a90ebdb908224b8233a25c314f73233df007c24712f6cdc6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/executor/dispatch/dispatch_sync_log_store.rs:398-408 | src/stream/src/executor/sync_kv_log_store.rs:819-829 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/stream/src/executor/dispatch/dispatch_sync_log_store.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"26945cdf2af1175a3ce334d9e2c39b9691b0c2f5ccd0cf1eab49d8e0e1f8a32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/executor/nested_loop_temporal_join.rs:266-276 | src/stream/src/executor/temporal_join.rs:824-834 \u2014 before extracting anything, compare \u0060src/stream/src/executor/nested_loop_temporal_join.rs\u0060 and \u0060src/stream/src/executor/temporal_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2670ef6db9c501a7e2077ef544a9bb062985960eb02bdf0296a709ddfae50718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs:120-130 | src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:244-254 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"43797c6550823eb4d6bcf6ec5ce65648238233307024acba78598b5c34f31aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:161-167 | src/stream/src/executor/source/fs_fetch_executor.rs:210-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7113e0e32a1c2e793c53499c9777c0af9636dd6a50f68a9e1ff737b1cb71ea58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/from_proto/asof_join.rs:72-82 | src/stream/src/from_proto/hash_join.rs:115-125 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/from_proto/asof_join.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff030b97af66da12d7749066fdb349f113cbcf922b25dac0d650523cc8bbabf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/from_proto/eowc_over_window.rs:39-49 | src/stream/src/from_proto/over_window.rs:41-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/eowc_over_window.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"90980ddd2bc2b6ee4fa9b0d11c7a631d2bed67f8f9fda8322cb04700d9c0efeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/from_proto/group_top_n.rs:46-56 | src/stream/src/from_proto/top_n.rs:39-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/group_top_n.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4061db97eddd1c2f02839ed8521a79c0d609f81581d47a27a62711159f61a245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/task/actor_manager.rs:433-443 | src/stream/src/task/actor_manager.rs:487-497 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/task/actor_manager.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3006437ff78e45b0853e1cacdc77ca33a409465a2d7bcc9cf753ddb99446f6ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/utils/pgwire/src/ldap_auth.rs:224-234 | src/utils/pgwire/src/ldap_auth.rs:332-342 \u2014 both copies are in the same file, so extract the block into one function there 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/utils/pgwire/src/ldap_auth.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bcb35cf5fc2438d7b781bfa47b35ae4a949143394738cafd81921b7884b650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/frontend/src/optimizer/plan_node/batch_hash_join.rs:108-117 | src/frontend/src/optimizer/plan_node/batch_lookup_join.rs:132-141 | src/frontend/src/optimizer/plan_node/stream_asof_join.rs:216-225 | src/frontend/src/optimizer/plan_node/stream_delta_join.rs:112-121 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:540-549 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_hash_join.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb73560f1665cf573f9ecb6dd6c1a778dd0ef922a3c2fbba2b530b34b5dda34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/meta/src/controller/streaming_job.rs:1273-1282 | src/meta/src/controller/streaming_job.rs:1310-1319 | src/meta/src/controller/streaming_job.rs:1791-1800 | src/meta/src/controller/streaming_job.rs:1897-1906 | src/meta/src/controller/streaming_job.rs:2309-2318 \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":"src/meta/src/controller/streaming_job.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b032f29fcb1e0b615d6499668034dd66ab68925c9b7c6a6227016ed8dcb41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 5): src/meta/src/hummock/mod.rs:102-109 | src/meta/src/hummock/mod.rs:136-145 | src/meta/src/hummock/mod.rs:163-172 | src/meta/src/hummock/mod.rs:200-209 | src/meta/src/rpc/metrics.rs:1134-1143 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ca81ffaa279845907851e3a951d1ac94b95ac0722a5714ef9b1adbe767dc24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/batch/executors/src/executor/hop_window.rs:154-163 | src/expr/core/src/expr/test_utils.rs:99-108 | src/frontend/src/optimizer/plan_node/generic/hop_window.rs:201-210 | src/stream/src/executor/hop_window.rs:86-95 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hop_window.rs\u0060 and \u0060src/stream/src/executor/hop_window.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"src/batch/executors/src/executor/hop_window.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac7d7722c750bc0e3fbac7ee858243783da66eefcb8d50e87d532127a8795ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/batch/executors/src/executor/join/hash_join.rs:873-882 | src/batch/executors/src/executor/join/hash_join.rs:970-979 | src/batch/executors/src/executor/join/hash_join.rs:1181-1190 | src/batch/executors/src/executor/join/hash_join.rs:1508-1517 \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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce52aa3f2270324b6b4e7f776c7568bb079f220d873595288ffeadb899749052"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/stream/src/executor/asof_join.rs:433-442 | src/stream/src/executor/asof_join.rs:459-468 | src/stream/src/executor/hash_join.rs:699-708 | src/stream/src/executor/hash_join.rs:727-736 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f17b80411886b64206d5de242d560db7211aa2afd18187f07ef959571509df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/stream/src/executor/dml.rs:230-239 | src/stream/src/executor/dml.rs:273-282 | src/stream/src/executor/dml.rs:298-307 | src/stream/src/executor/sink.rs:679-688 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dml.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb93e73eb3d1b9f07b04e5883ffd38971808ce4121d42ac8c43251c2bdab885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/batch/executors/src/executor/join/hash_join.rs:979-988 | src/batch/executors/src/executor/join/hash_join.rs:1190-1198 | src/batch/executors/src/executor/join/hash_join.rs:1597-1605 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb201bb05385f1db763ed7392b0c582f06a8b6432981fc5d32fc0493895de3dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/batch/executors/src/executor/join/hash_join.rs:989-998 | src/batch/executors/src/executor/join/hash_join.rs:1199-1208 | src/batch/executors/src/executor/join/hash_join.rs:1607-1616 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d750bc3a480d2bd76d51e32d7415a788b374de9b58634eb205240d871718d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/batch/executors/src/executor/join/hash_join.rs:1333-1342 | src/batch/executors/src/executor/join/hash_join.rs:1450-1459 | src/batch/executors/src/executor/join/hash_join.rs:1605-1614 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba0bf20a5e64af2bd31eb171bf806e7878f74ca6cc7a64482ce7d764ee7bc27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/batch/executors/src/executor/join/nested_loop_join.rs:256-268 | src/batch/executors/src/executor/join/nested_loop_join.rs:382-391 | src/batch/executors/src/executor/join/nested_loop_join.rs:426-435 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/batch/executors/src/executor/join/nested_loop_join.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe40d085d32e9fe3fa67d91bbd1eed6f3159d96ab2e82a76604838c0aaa969c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/batch/executors/src/executor/sort_over_window.rs:63-72 | src/stream/src/from_proto/eowc_over_window.rs:40-49 | src/stream/src/from_proto/over_window.rs:42-51 \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":"src/batch/executors/src/executor/sort_over_window.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75dbb5f5e0e30a756cf4b6019b5c9fe0ae522fa0e8362594aa21fad7d135228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/connector/src/parser/unified/debezium.rs:750-759 | src/connector/src/parser/unified/debezium.rs:815-824 | src/connector/src/parser/unified/debezium.rs:1187-1196 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/connector/src/parser/unified/debezium.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ad25a97bb06a140601a7d063ce431a850073b06a618a98ca44a6e037883b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/frontend/src/catalog/system_catalog/mod.rs:245-254 | src/meta/src/controller/fragment.rs:1573-1582 | src/meta/src/manager/diagnose.rs:1264-1273 \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":"src/frontend/src/catalog/system_catalog/mod.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a1849a930570ecab8327e4630f21c60c83b7d04fd3528acddfa13db1c0d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:245-254 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:330-339 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:475-484 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7504b9ef460336e31b1e2a3632b636a512506ba7b48337e1ab60b73367b3868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/frontend/src/handler/alter_owner.rs:89-98 | src/frontend/src/handler/alter_owner.rs:134-143 | src/frontend/src/handler/alter_owner.rs:151-160 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b4b66263d64037dea636d4573086bdac204e64a44ef6b6414dcdc8c05c83d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/frontend/src/handler/alter_owner.rs:122-131 | src/frontend/src/handler/alter_owner.rs:139-148 | src/frontend/src/handler/alter_owner.rs:156-165 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d716de0484a67f5e5024d8df5a6fef4a793a0ab9f9f72eeacb1d8181ff057a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/meta/model/migration/src/m20240304_074901_subscription.rs:13-22 | src/meta/model/migration/src/m20240506_112555_subscription_partial_ckpt.rs:14-23 | src/meta/model/migration/src/m20240506_112555_subscription_partial_ckpt.rs:64-73 \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":"src/meta/model/migration/src/m20240304_074901_subscription.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc324d464379f1b21e237a9e2c2e86b6e41fa87b63e277263bddced9bb5290ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/batch/executors/src/executor/aggregation/orderby.rs:78-87 | src/frontend/src/datafusion/aggregate/orderby.rs:79-88 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/aggregation/orderby.rs\u0060 and \u0060src/frontend/src/datafusion/aggregate/orderby.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/aggregation/orderby.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"033f78bd8221902b7859b0618e9c30daac416e797ea213566e3e4d86b8d2051c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:436-445 | src/batch/executors/src/executor/order_by.rs:401-410 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/order_by.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"39931c83551fc0c216047776dc90b7b2f8634ee9715641cfd6b74afab1dae89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/connector/src/connector_common/iceberg/mod.rs:686-694 | src/connector/src/connector_common/iceberg/mod.rs:1075-1084 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc27894911db0a26f1d469cac8549982d922af6f69bd7040056cc686bdf4e639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/connector/src/sink/starrocks.rs:584-593 | src/connector/src/sink/starrocks.rs:607-616 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/starrocks.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeeccd04e738c49eea929bc17bf7992dca9a715b21e35a2d417b0ceafa3a09c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/connector/src/source/cdc/enumerator/mod.rs:330-338 | src/connector/src/source/cdc/external/sql_server.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/cdc/enumerator/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da5665dff1e3615236015c70fd0a7b28adb54f1e73d74ec2ff8ae2f3864020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/expr/impl/src/scalar/encdec.rs:132-141 | src/expr/impl/src/scalar/encdec.rs:156-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":"src/expr/impl/src/scalar/encdec.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0ebd32594dd21a13b41000a9f8658c390aaecc2c5f0a44aa99b8f9323cf01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/expr/impl/src/scalar/jsonb_path.rs:77-86 | src/expr/impl/src/scalar/jsonb_path.rs:99-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/jsonb_path.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6d3837be02af56644553a5eb8172a887083685752df3e983e0751d01368ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/expr/macro/src/gen.rs:153-162 | src/expr/macro/src/gen.rs:1151-1160 \u2014 both copies are in the same file, so extract the block into one function there 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/expr/macro/src/gen.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6568d9297a9706d5a349a7aa2126724895ceed4b6e67691f85f1c575d5f40f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/expr/macro/src/gen.rs:470-479 | src/expr/macro/src/gen.rs:1304-1313 \u2014 both copies are in the same file, so extract the block into one function there 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/expr/macro/src/gen.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b7239a8c7514a951df5f4f04e141ed5b946d072bdf9e95b3f6f78ab2535b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/binder/for_system.rs:36-45 | src/frontend/src/binder/for_system.rs:53-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/for_system.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b4ff3972197c1c81903ab23cd95050947738b2f38c0248beca0c972a300ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/hop_window.rs:253-262 | src/frontend/src/optimizer/plan_node/generic/hop_window.rs:275-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/hop_window.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"63430e090cdbe20aaebf7efc1321b68405756ce1282dabb9c621c96725eb7b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/join.rs:234-243 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:356-365 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e755622d89107ec2717c0b50bbdf9771c242f09f5255f978eb62cb17bb9a51e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/join.rs:243-252 | src/frontend/src/optimizer/plan_node/stream_asof_join.rs:179-188 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc6c5ff82b0cfe136a68f446c9f6902ce3b1742b24025be106f63d12f79ec34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/join.rs:332-341 | src/frontend/src/optimizer/plan_node/generic/join.rs:345-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":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f818d5bd2d3ea182a7f17ae6b27b4c45c211ee1b93f319fd6fba8c55ac8c143b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/join.rs:511-520 | src/frontend/src/optimizer/plan_node/generic/join.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c863ad2055a5e3a83f0a21ce7b10b538a02fe1fb6bb01b9a4c85ee7ff863b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/table_scan.rs:268-277 | src/frontend/src/optimizer/rule/index_selection_rule.rs:192-201 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/optimizer/plan_node/generic/table_scan.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a47fe5a1d4cd01927d44339189f86e36851ef12ee9bef52b1c1f265e0a93a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_join.rs:301-309 | src/frontend/src/optimizer/plan_node/logical_join.rs:1161-1170 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f2228de22f34da1cb6d24408638fc7d00710d036015556ba861de629e3fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_join.rs:431-440 | src/frontend/src/optimizer/plan_node/logical_join.rs:1204-1213 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1064851c1b746014a3c40536c715c154d23adb67979c69bb33d1063c2d9860ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_union.rs:201-210 | src/frontend/src/optimizer/plan_node/logical_union.rs:275-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_union.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e37a0bb34b7713fcd1974e0c3d24da3877becb44ff4c1cf9f3523b1a7d35bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_union.rs:218-226 | src/frontend/src/optimizer/plan_node/logical_union.rs:308-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_union.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b71a054ff171aad801ac9ebfb6c5ffd48c3366760239fc190ba67fedf891224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_asof_join.rs:228-237 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:581-590 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_asof_join.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3e4a311393e3937f0832a87d070029feae622e2af76b807aab031e8c154a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_locality_provider.rs:198-207 | src/frontend/src/optimizer/plan_node/stream_table_scan.rs:275-284 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_locality_provider.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c1e1e5b73fb6b8ebf0deaec548ccf7774d051bd767bda00e55a79055d97cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/utils/with_options.rs:548-557 | src/frontend/src/utils/with_options.rs:559-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":"src/frontend/src/utils/with_options.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6031a7a1ee72c6d936342a2e70d7002e827b17d6a5b6a8d60fc6c57e3975ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/handler/alter_owner.rs:94-103 | src/frontend/src/handler/alter_owner.rs:108-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":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4b3c852b7ed528a30b8430eaf8b6f61eec7b18593957684cf6eb8dd2fb8195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/handler/create_function.rs:187-196 | src/frontend/src/handler/create_sql_function.rs:159-168 \u2014 before extracting anything, compare \u0060src/frontend/src/handler/create_function.rs\u0060 and \u0060src/frontend/src/handler/create_sql_function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_function.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1ffc93aa89211a833fe32cd0d62641af708a3e6d2f478ee5e6a12bc163911b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/handler/create_aggregate.rs:138-147 | src/frontend/src/handler/create_function.rs:193-202 \u2014 before extracting anything, compare \u0060src/frontend/src/handler/create_aggregate.rs\u0060 and \u0060src/frontend/src/handler/create_function.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_aggregate.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"041d33175aed682a027fd0e3fa5b6196c0b5573dea3e876b39b37f6b07960ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/handler/alter_rename.rs:296-305 | src/frontend/src/handler/drop_database.rs:62-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_rename.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"433aee17e2779f4c4da6b3410b032f44589359584b7796139e8d055f3aaa74b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/meta/src/barrier/backfill_order_control.rs:68-77 | src/meta/src/barrier/backfill_order_control.rs:136-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/backfill_order_control.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"54518ec50b87466142ac0981b6fe11e5556224f695142ccb869965df5e2ceb21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/meta/src/barrier/checkpoint/state.rs:471-480 | src/meta/src/barrier/checkpoint/state.rs:1250-1259 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c8677a69e4fcf2ca9d071cf30d29142ec0de44329946c7702d15e5bb657a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/meta/src/barrier/edge_builder.rs:539-548 | src/meta/src/barrier/edge_builder.rs:578-587 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/edge_builder.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"673bfa73b42839d4bda4f666c86b9740386fb1ab83867ab7ff013670cf93b4ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/meta/src/controller/fragment.rs:1355-1364 | src/meta/src/stream/scale.rs:632-640 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/meta/src/controller/fragment.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e02d6b1664b86f83c24517217180720973a7c613af0b63bf43510181dc54eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/meta/src/stream/stream_graph/state_match.rs:551-563 | src/meta/src/stream/stream_graph/state_match.rs:565-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":"src/meta/src/stream/stream_graph/state_match.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51fdf40a5edfd9ea429c100a81f1f906dae5a19ced24c045b098dc8d4f58b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:347-356 | src/meta/src/controller/catalog/alter_op.rs:416-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"de164eff3cf61e5a917f7d33c04d7d8c8ebd3a18e356adb5521890cff5dfa4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:488-497 | src/meta/src/controller/catalog/util.rs:328-336 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bf48dbe905c8b0e405d96f7d1da6097411cc5e2715f66f25daeca23f600861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/sqlparser/src/tokenizer.rs:895-904 | src/sqlparser/src/tokenizer.rs:933-942 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/tokenizer.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5d89470b7c3d64a97bf7c8200ef9216023867176c8a71e0a66da497e33f9c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/storage/hummock_sdk/src/sstable_info.rs:239-248 | src/storage/hummock_sdk/src/sstable_info.rs:290-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/sstable_info.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f385d1f09a105ad3ff1251dcfe62539caa9121c68cb8401090e5a84cb30d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/stream/src/executor/gap_fill.rs:123-132 | src/stream/src/executor/gap_fill.rs:148-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/gap_fill.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4231219924416111573706cd761976e3f3fe928484fac259cd658b7e21867e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs:203-212 | src/stream/src/executor/source/iceberg_fetch_executor.rs:456-465 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbe699d4235fc2b68215f02ab88fabe7b4d35f6b10c0cfe9e7f8a5e3066c613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:89-96 | src/stream/src/executor/source/iceberg_list_executor.rs:108-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_iceberg_list.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e219c3362d4393206921ceb98a4f06777d861fe704d468db674f2be670a1c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/stream/src/executor/top_n/group_top_n.rs:237-245 | src/stream/src/executor/top_n/group_top_n_appendonly.rs:206-215 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/group_top_n.rs\u0060 and \u0060src/stream/src/executor/top_n/group_top_n_appendonly.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/group_top_n.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5897906e66641c85a462ca0c125f2199112b755034fe964e4c96a5c52cdefc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/stream/src/executor/top_n/top_n_appendonly.rs:133-142 | src/stream/src/executor/top_n/top_n_plain.rs:172-181 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/top_n_appendonly.rs\u0060 and \u0060src/stream/src/executor/top_n/top_n_plain.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/top_n_appendonly.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d0002e2fe41fb9178eb43e847818a2c04ffe2c4e884799e9b85e6b33996567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/stream/src/executor/over_window/frame_finder.rs:286-295 | src/stream/src/executor/over_window/frame_finder.rs:352-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/frame_finder.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"de34828e19be6f7da5c0d67fe5203c92baae8fe16b74938397aa95836668c3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 13): src/connector/src/sink/big_query.rs:282-290 | src/connector/src/sink/clickhouse.rs:383-391 | src/connector/src/sink/doris.rs:116-124 | src/connector/src/sink/file_sink/azblob.rs:113-121 | src/connector/src/sink/file_sink/fs.rs:82-90 | src/connector/src/sink/file_sink/gcs.rs:98-106 | src/connector/src/sink/file_sink/s3.rs:142-150 | src/connector/src/sink/file_sink/webhdfs.rs:87-95 | src/connector/src/sink/mongodb.rs:169-177 | src/connector/src/sink/postgres.rs:154-162 | src/connector/src/sink/snowflake_redshift/snowflake.rs:233-241 | src/connector/src/sink/sqlserver.rs:86-94 | src/connector/src/sink/starrocks.rs:159-167 \u2014 before extracting anything, compare \u0060src/connector/src/sink/doris.rs\u0060 and \u0060src/connector/src/sink/sqlserver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/big_query.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85d59fe1605c0b9a9f1dfe92362987ce320c9002d59d0d3e7ebeb22a28817ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): src/batch/executors/src/executor/join/hash_join.rs:792-800 | src/batch/executors/src/executor/join/hash_join.rs:873-881 | src/batch/executors/src/executor/join/hash_join.rs:970-978 | src/batch/executors/src/executor/join/hash_join.rs:1048-1056 | src/batch/executors/src/executor/join/hash_join.rs:1108-1116 | src/batch/executors/src/executor/join/hash_join.rs:1181-1189 | src/batch/executors/src/executor/join/hash_join.rs:1259-1267 | src/batch/executors/src/executor/join/hash_join.rs:1321-1329 | src/batch/executors/src/executor/join/hash_join.rs:1438-1446 | src/batch/executors/src/executor/join/hash_join.rs:1508-1516 | src/batch/executors/src/executor/join/hash_join.rs:1587-1595 \u2014 all 11 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebb177a12f092f077edc6e1e918b70360b232eca2f90bd968d78dde10ab8a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/frontend/src/optimizer/plan_node/generic/file_scan.rs:111-119 | src/frontend/src/optimizer/plan_node/generic/file_scan.rs:158-166 | src/frontend/src/optimizer/plan_node/generic/file_scan.rs:171-179 | src/frontend/src/optimizer/plan_node/generic/mysql_query.rs:58-66 | src/frontend/src/optimizer/plan_node/generic/postgres_query.rs:60-68 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/file_scan.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d79913e0c40c322f60c12e626fc04933b9f89c91f8bd167a47eb8718bd7f4ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 5): src/frontend/src/handler/alter_owner.rs:92-100 | src/frontend/src/handler/alter_owner.rs:107-114 | src/frontend/src/handler/alter_owner.rs:121-128 | src/frontend/src/handler/alter_owner.rs:137-145 | src/frontend/src/handler/alter_owner.rs:154-162 \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":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03e9041c2b93e85792794cc1b88f6822f86c5e0f2185aa791b330951213c846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/batch/executors/src/executor/hash_agg.rs:399-407 | src/batch/executors/src/executor/join/hash_join.rs:342-350 | src/batch/executors/src/executor/join/hash_join.rs:370-378 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/join/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5abe097c5b440c061c072a14c32f617e62cdefe098b3eb17e0411da917bd07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/connector/src/sink/doris.rs:397-405 | src/connector/src/sink/doris.rs:410-418 | src/connector/src/sink/doris.rs:424-432 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/connector/src/sink/doris.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d22377f8c36092625d9bce09448bfb103219f71853d781a05139118214309d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/frontend/src/optimizer/plan_node/generic/join.rs:246-254 | src/frontend/src/optimizer/plan_node/stream_asof_join.rs:182-190 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:375-383 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/join.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea5b36445ea6bf6a0809f8eff42d120b2a9d6ca503fbc9601ec6903f39ced8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/frontend/src/scheduler/distributed/stage.rs:748-756 | src/frontend/src/scheduler/fast_insert.rs:44-52 | src/frontend/src/scheduler/local.rs:655-663 \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":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d181a9bdd2e13e3b316fae02b651fbb530e7f5dbab66595e6344ee5263a83dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/frontend/src/handler/alter_connection_props.rs:49-57 | src/frontend/src/handler/alter_sink_props.rs:59-67 | src/frontend/src/handler/alter_table_props.rs:87-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/handler/alter_connection_props.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00e3ed5339a83f2ddf650710ef8e8fb5e50038df05f455c7017d23e6e3dea98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/storage/src/mem_table.rs:163-171 | src/storage/src/mem_table.rs:221-229 | src/storage/src/mem_table.rs:307-315 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/storage/src/mem_table.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfe50fa727796f59ef3d3e070cea293f7c33a4d4891c2ffac858a9d3ed61124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:2089-2097 | src/batch/executors/src/executor/join/hash_join.rs:2139-2147 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf59ee8033a5fe70c83a539a96bf189ec68d40f3988b89241cdf42cf8d3c1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/common/src/session_config/parallelism.rs:120-128 | src/common/src/session_config/parallelism.rs:186-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/session_config/parallelism.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0dd79769b5b726ed745a5e5b9f6ed0c8a025e4bd50dd285c5824436978adc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/compute/src/observer/observer_manager.rs:38-46 | src/frontend/src/observer/observer_manager.rs:540-548 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/compute/src/observer/observer_manager.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dc88e8c2fa7cf32189b6eb35013ab7021b34ab2861a27138b38ad792bdaab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/ctl/src/cmd_impl/profile.rs:44-52 | src/ctl/src/cmd_impl/profile.rs:114-122 \u2014 both copies are in the same file, so extract the block into one function there 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/ctl/src/cmd_impl/profile.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffeeb4495823209d9e2d6b147a87bb4becda5570316df7ea28ea80b10ef8f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/expr/core/src/expr/mod.rs:94-102 | src/expr/core/src/expr/mod.rs:132-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/core/src/expr/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"20458b099f6deacc0e70871aa2e0967dafa307952cc2de9520cfba3e6fcc5ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/binder/relation/watermark.rs:66-74 | src/frontend/src/binder/relation/window_table_function.rs:86-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":"src/frontend/src/binder/relation/watermark.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cde4609d26a0053110abbc68abd0da7ca142b0e0a7592079473c156809d9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/binder/relation/watermark.rs:78-86 | src/frontend/src/binder/relation/window_table_function.rs:111-119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/binder/relation/watermark.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6fea0fee8eeacd2889e82568fe9be3abaca2f0f99c9d229f6a5cbb6d04701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/frontend/src/binder/select.rs:74-82 | src/frontend/src/binder/select.rs:84-92 | src/frontend/src/binder/select.rs:93-102 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/binder/select.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"56940eddd68119d2a52ec0c29cfd5759fbe905631fe973c60b6f42b461e7b36a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs:115-122 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs:107-115 \u2014 before extracting anything, compare \u0060src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs\u0060 and \u0060src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_files.rs\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_all_files.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9862b9766be5265b59c4099ac8127736877e5cbc440e7e084c3c124711aa8d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/expr/function_call.rs:307-315 | src/frontend/src/expr/function_call_with_lambda.rs:109-117 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/function_call.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab1d8f1cbd07762a3ca754cd6c3875440da61d16c0bf4aefd4973a5c56327d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/observer/observer_manager.rs:363-371 | src/frontend/src/observer/observer_manager.rs:402-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/observer/observer_manager.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a46f074cfbc0da6ad9f9aeee499fd8fadf47cd0f050297720534dffb1892d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/observer/observer_manager.rs:373-381 | src/frontend/src/observer/observer_manager.rs:412-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":"src/frontend/src/observer/observer_manager.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"424df762d9450c50b144e972ac39dab5c23707184b5b93c5f1267d5078795039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_log_seq_scan.rs:92-100 | src/frontend/src/optimizer/plan_node/batch_sys_seq_scan.rs:66-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_log_seq_scan.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa56d251a9999a0978f99b3d0bfcec37c40d9e1459bac0121ea2be814fa5a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_asof_join.rs:140-148 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:289-297 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_asof_join.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c013d8c16c504e9349fe80955d4baade3390a343fe75ac1eb7a34d723313a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_iceberg_with_pk_index_writer.rs:129-137 | src/frontend/src/optimizer/plan_node/stream_sink.rs:948-956 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_iceberg_with_pk_index_writer.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba805ef9d9b7fe16fae6f474307d11adc82fd033a5ae1c5a8dc1c3891321423e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_materialize.rs:642-650 | src/frontend/src/optimizer/plan_node/stream_vector_index_write.rs:216-224 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_materialize.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979dd9a6a4ae0d2084a339cf7b722c35d21b298b80313379735b7b924fd5a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/webhook/mod.rs:189-197 | src/frontend/src/webhook/mod.rs:207-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/webhook/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0cf00e855a67b5dfceea6389e54f683725480c7b0056f5eb7c74da102959e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/frontend/src/handler/alter_rename.rs:173-181 | src/frontend/src/handler/alter_subscription_retention.rs:92-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_rename.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e4d327d7e32a651efa3b84915e8690c1f387ec16d5664b2669eadb91cb301f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/meta/src/barrier/info.rs:1087-1095 | src/meta/src/barrier/info.rs:1135-1143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/info.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5f4efd599e69324a8b8cd63af0891013da587a09ba28d2ff733bbf93a6c05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/meta/src/hummock/manager/time_travel.rs:753-761 | src/meta/src/hummock/manager/time_travel.rs:779-787 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee552540d5c56adf38194508bd81a64725208d6bbdaa517e048ef7ac4ed6cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/meta/src/stream/scale.rs:233-241 | src/meta/src/stream/scale.rs:293-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":"src/meta/src/stream/scale.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7598dadfc4de36021930a7966a469a26cad7c72a49d1ac3711e1318d953c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:510-518 | src/meta/src/controller/catalog/util.rs:142-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d5db26c9b7ec5086735809f52bfc9d6381c5862d1937787a99c4a1a1d2507a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/risedevtool/src/bin/risedev-dev.rs:268-276 | src/risedevtool/src/bin/risedev-dev.rs:411-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48c24b9688ecc714e59fe4d7415d0f0cc2ca6aa2f9ad6299fa3f348d0676ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/risedevtool/src/bin/risedev-dev.rs:269-277 | src/risedevtool/src/bin/risedev-dev.rs:351-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc4583754038addb0700f44419ff81d1cd50e90e0e0b937a0463b83f8ce22b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/risedevtool/src/task/compactor_service.rs:85-93 | src/risedevtool/src/task/frontend_service.rs:98-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/risedevtool/src/task/compactor_service.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afcbd41d9e9ab8225fda2b9225106a1bda34347abb67c10d4170785d0280326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/sqlparser/src/ast/mod.rs:3081-3090 | src/sqlparser/src/ast/query.rs:432-440 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/sqlparser/src/ast/mod.rs"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d995a0fb8b8787958dbb772c83a4612a9d94e73aa52e6eb5394e3d9b1ec51f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/storage/src/hummock/sstable/writer.rs:287-295 | src/storage/src/hummock/sstable/writer.rs:299-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable/writer.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5f96e79e2b777845ff71089b0185daf1ef85970897ad826c0744724ecd46d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/storage/src/monitor/local_metrics.rs:549-557 | src/storage/src/monitor/local_metrics.rs:587-595 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/monitor/local_metrics.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2312f6f95cff075e34928fa78b4d36314c393a7a3f45f07a981c72acf8daa9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/stream/src/executor/nested_loop_temporal_join.rs:151-159 | src/stream/src/executor/temporal_join.rs:667-675 \u2014 before extracting anything, compare \u0060src/stream/src/executor/nested_loop_temporal_join.rs\u0060 and \u0060src/stream/src/executor/temporal_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f993bb629a7d68ca7bae544009c22f8b2c83f3bffafd034cecd9352795a57ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/stream/src/executor/nested_loop_temporal_join.rs:179-187 | src/stream/src/executor/temporal_join.rs:716-724 \u2014 before extracting anything, compare \u0060src/stream/src/executor/nested_loop_temporal_join.rs\u0060 and \u0060src/stream/src/executor/temporal_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/nested_loop_temporal_join.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f077efab598a5c29fc088f33dc1c98d06227f2553cfa19b6ed7b15162a47582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:132-140 | src/stream/src/executor/source/fs_fetch_executor.rs:258-266 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eddb880c9f9512bf21995b7b1695e754d2979e607eea0bc789ee529322d1e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/stream/src/executor/source/fs_list_executor.rs:150-158 | src/stream/src/executor/source/iceberg_list_executor.rs:221-229 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/executor/source/fs_list_executor.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7f32a31bf33dda8edc0856156d35d8e25f657cee38c5cd1ee0e34c3a86e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/utils/pgwire/src/pg_protocol.rs:1662-1670 | src/utils/pgwire/src/pg_protocol.rs:1674-1682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"4621d4d0bb300be3eff14d8dd96b539a1f53506dd23ba9ed827d5d56c8ba0acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): src/frontend/src/handler/handle_privilege.rs:79-86 | src/frontend/src/handler/handle_privilege.rs:103-110 | src/frontend/src/handler/handle_privilege.rs:140-147 | src/frontend/src/handler/handle_privilege.rs:154-161 | src/frontend/src/handler/handle_privilege.rs:169-176 | src/frontend/src/handler/handle_privilege.rs:183-190 | src/frontend/src/handler/handle_privilege.rs:197-204 | src/frontend/src/handler/handle_privilege.rs:210-217 | src/frontend/src/handler/handle_privilege.rs:255-262 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/handle_privilege.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2786ba8564f5e439d0347153e08607555f1c4c2faf92282f090a25103a1bf3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:75-80 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:98-103 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:120-127 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:152-159 \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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"79786fc514aa67556f454bdeaeb9801854542edcb9c0f5d68bad265585daa919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:116-123 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:137-144 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:158-165 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:180-188 \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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2120c23c072c290196bd3c15fffb40e923e95b2cf3349b3aee445f4e518e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/frontend/src/handler/alter_rename.rs:91-98 | src/frontend/src/handler/alter_rename.rs:120-127 | src/frontend/src/handler/alter_rename.rs:150-157 | src/frontend/src/handler/alter_rename.rs:181-188 \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":"src/frontend/src/handler/alter_rename.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5020ca5efcb92817f4cf8841c8c694a668693080c94cbced0e9048dec81206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): src/connector/src/connector_common/iceberg/mod.rs:683-689 | src/connector/src/connector_common/iceberg/mod.rs:1042-1049 | src/connector/src/connector_common/iceberg/mod.rs:1071-1078 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ff929c94664335fc46653f460a6b20f9748c9fcff32cba851596b7334a990c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/expr/impl/src/scalar/to_char.rs:268-275 | src/expr/impl/src/scalar/to_char.rs:286-293 | src/expr/impl/src/scalar/to_char.rs:335-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/to_char.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e00d6078cf957efc20cf95a0b8d120083393d7f73297959a1ea80741edf7325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/expr/impl/src/scalar/to_char.rs:267-274 | src/expr/impl/src/scalar/to_char.rs:334-341 | src/expr/impl/src/scalar/to_char.rs:344-351 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/to_char.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a0a76d3b18b6b9613aa1089c7cdbbb6a51dac081b5cee13ab400fba9cc84a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): src/frontend/src/optimizer/plan_node/logical_agg.rs:632-639 | src/frontend/src/optimizer/plan_node/logical_agg.rs:684-691 | src/frontend/src/optimizer/plan_node/logical_agg.rs:694-701 | src/frontend/src/optimizer/plan_node/logical_agg.rs:703-708 \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":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"68597efd766991d6ba2bb58d1208ed9914ec79cb06cde00312b4e2e5477eb045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/frontend/src/optimizer/plan_node/logical_agg.rs:1308-1315 | src/frontend/src/optimizer/plan_node/logical_over_window.rs:575-582 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:281-288 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_agg.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_over_window.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5d224d12a865ee357dfce6ca273ee630c74d3b4606eadd91e903ff77d3bd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/frontend/src/optimizer/plan_node/stream_asof_join.rs:227-234 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:580-587 | src/frontend/src/optimizer/plan_node/stream_temporal_join.rs:245-252 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/stream_asof_join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_asof_join.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3157ddd18b3782ced014429ae16df6bad0bda02300d8a258210da885a681a8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/risedevtool/src/bin/risedev-dev.rs:269-276 | src/risedevtool/src/bin/risedev-dev.rs:351-358 | src/risedevtool/src/bin/risedev-dev.rs:412-420 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc136c2798dfe719b36d09c41f53706ceef00f89448cfaef7ebc10df3cd08ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/risedevtool/src/task/compactor_service.rs:71-78 | src/risedevtool/src/task/compute_node_service.rs:78-85 | src/risedevtool/src/task/meta_node_service.rs:249-256 \u2014 before extracting anything, compare \u0060src/risedevtool/src/task/compactor_service.rs\u0060 and \u0060src/risedevtool/src/task/compute_node_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/task/compactor_service.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2b4330de616ac98e679a484b43c0788f54c899c221cfdb1b57aa5e0e42ab2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/storage/src/mem_table.rs:154-161 | src/storage/src/mem_table.rs:212-219 | src/storage/src/mem_table.rs:298-305 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/storage/src/mem_table.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c8fb2ded5d6d93825ce4c802e1afac957f0cfc03c02b180fc36ac75e3c0490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/stream/src/executor/source/batch_source/batch_posix_fs_list.rs:246-253 | src/stream/src/executor/source/fs_list_executor.rs:148-155 | src/stream/src/executor/source/iceberg_list_executor.rs:219-226 \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":"src/stream/src/executor/source/batch_source/batch_posix_fs_list.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a7c92aa69faece6f480d06125d77f7c1bc7a83a14e8dbc54cd69b102faf02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:498-505 | src/batch/executors/src/executor/order_by.rs:118-125 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/order_by.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b315217239c39afe8d61975c9905579b165c4f03fe972fb819e81d00cf82e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/batch/executors/src/executor/sort_agg.rs:154-161 | src/batch/executors/src/executor/sort_agg.rs:185-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/sort_agg.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e7e88ac8c3280de0a6ef8c415c06fa41195f054cb7e0030c6b8fb77471014b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20138 lines \u00D7 3): src/common/src/array/arrow/arrow_impl.rs:260-267 | src/common/src/array/arrow/arrow_impl.rs:285-292 | src/common/src/array/arrow/arrow_impl.rs:336-336 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/array/arrow/arrow_impl.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46ddf563accccb3e8b20c7b575a5be12e6c4c4ea7afeced7b23eea7e351fbb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/common/src/array/list_array.rs:810-817 | src/common/src/array/list_array.rs:850-857 \u2014 both copies are in the same file, so extract the block into one function there 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/common/src/array/list_array.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa6e5453b4b949aa1ba7864db2d814d94163b150669c70c6f2a2693385ee76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/connector/src/connector_common/iceberg/jni_catalog.rs:378-385 | src/connector/src/connector_common/iceberg/jni_catalog.rs:476-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/iceberg/jni_catalog.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"989f751c10f8ab9c21db451508f63bed87f9409d89db1219dca0a3925640a7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/connector/src/sink/iceberg/commit.rs:855-862 | src/connector/src/sink/iceberg/commit.rs:880-887 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/iceberg/commit.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bda553958df293e1c74b10f6e163a3df7fea0f6bbfe4506be556932af4ec337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/connector/src/sink/redis.rs:165-172 | src/connector/src/sink/redis.rs:174-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/redis.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f471ebeaf5f0e5847250bdc4298b63cea43545c1dba919b8b5158218742530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/connector/src/source/cdc/external/sql_server.rs:118-125 | src/connector/src/source/cdc/external/sql_server.rs:152-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/cdc/external/sql_server.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0224355e254a5653812e01b11768b638a934f755617bbd376cb8bacb7fa20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/ctl/src/cmd_impl/hummock/validate_version.rs:78-85 | src/ctl/src/cmd_impl/hummock/validate_version.rs:178-185 \u2014 both copies are in the same file, so extract the block into one function there 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/ctl/src/cmd_impl/hummock/validate_version.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6f623af08e5d1fb07b7722e9ec921376a234ed0330f9d76eb7b8b1d54392f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/expr/impl/src/aggregate/approx_count_distinct/mod.rs:69-76 | src/expr/impl/src/aggregate/approx_count_distinct/mod.rs:131-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/aggregate/approx_count_distinct/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37bc7abb14686f144e1a77ebc392006dda664f892c61c80bcfc4dfce46420cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/expr/impl/src/aggregate/approx_count_distinct/mod.rs:85-92 | src/expr/impl/src/aggregate/approx_count_distinct/mod.rs:147-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":"src/expr/impl/src/aggregate/approx_count_distinct/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bab6bc43a87905a5459b1bcfb0deb5b274b80c4738039c2f34715a945c51f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/expr/impl/src/scalar/date_trunc.rs:46-53 | src/expr/impl/src/scalar/date_trunc.rs:104-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/date_trunc.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ce5cf144230e8f189f95aeb47be1d676d4a363a29515563cddeec1da2c69d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/planner_test/src/lib.rs:699-706 | src/frontend/planner_test/src/lib.rs:760-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/planner_test/src/lib.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4f80ca62c3f9ad224e749d624bcb1bb0a5b994ea38f07c0fa0c98eee1d71db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/binder/relation/match_recognize.rs:1153-1160 | src/stream/src/executor/match_recognize/proto.rs:50-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/binder/relation/match_recognize.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0401e0dd94bd247544b01a7c6ba587c69de46fcc6d0de3571ffe53d8b9e3405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/expr/session_timezone.rs:225-232 | src/frontend/src/expr/session_timezone.rs:238-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/session_timezone.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10bf87a0291dea3c8674fd044d6c927ef4686025d4022cd1f105d8617bd0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/expr/type_inference/func.rs:372-379 | src/frontend/src/expr/type_inference/func.rs:389-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6656f980989cfd925d85d47a4cd30b06df180aa00b197a49c7e9b9653bb89604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_cdc_table_scan.rs:139-146 | src/frontend/src/optimizer/plan_node/stream_table_scan.rs:354-361 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_cdc_table_scan.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eac68a5a3b24c8e578c24014fff5d548bf46a3818d8862449484b0d21249ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_project.rs:84-91 | src/frontend/src/optimizer/plan_node/stream_project_set.rs:47-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_project.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fbbde084bd53ae578999f4a9a0f1d51fb6a89f5b86b19ec308218618c4b5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/handler/alter_source_props.rs:110-117 | src/frontend/src/handler/create_source/validate.rs:308-315 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/handler/alter_source_props.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f2ac56cf008bd65937e47eeae8621f28d4d4eb2ce99978db29e0f4a8c1e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/handler/drop_connection.rs:36-43 | src/frontend/src/handler/drop_table.rs:35-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/drop_connection.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"db407b0a63b48a85671afe2879cfd17e5550da262c8ed0995a817246709f304e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/handler/create_aggregate.rs:123-130 | src/frontend/src/handler/create_function.rs:178-185 \u2014 before extracting anything, compare \u0060src/frontend/src/handler/create_aggregate.rs\u0060 and \u0060src/frontend/src/handler/create_function.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_aggregate.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0635fd3fabf42a471ee0672fbefbe4067e32103e88601286e530523cdc43efe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/handler/alter_mv.rs:42-49 | src/frontend/src/handler/alter_rename.rs:39-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/handler/alter_mv.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1e240f0e03cc03bdb5f987074ab19e25513197b3174977c081c5d1a6bc11ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/handler/comment.rs:52-59 | src/frontend/src/handler/comment.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/comment.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"78badff328abdcd4d4d16a5967a2996be3908fa941fcc0a42f329ae82fa0b200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/service/src/ddl_service.rs:279-286 | src/meta/service/src/ddl_service.rs:318-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"99561af1901c99fea133705728e9879ff762425a75f7cd5f5d25b3da9c255199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/src/barrier/command.rs:166-173 | src/meta/src/controller/scale.rs:313-320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/command.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d018ab26b435de391aca5e8a3d0224a0768e35edf0f72719fff46f8b07defe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/src/controller/catalog/mod.rs:553-560 | src/meta/src/controller/catalog/mod.rs:574-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":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f829799570cb80b3ab0d5bd22b8b80eab081aaa84ecb05899e8862fc526ba54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/src/hummock/compaction/selector/emergency_selector.rs:50-57 | src/meta/src/hummock/compaction/selector/level_selector.rs:459-467 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/meta/src/hummock/compaction/selector/emergency_selector.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5ab3efd115be99d90c6c9077ed1d5caf58937499a65072dffe423450ee1e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/src/rpc/ddl_controller.rs:1613-1620 | src/meta/src/rpc/ddl_controller.rs:2166-2173 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"143e95035b280aa6de4979eeb70e64b9bcc223304f6971941a306bec7ee56d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/src/rpc/metrics.rs:269-276 | src/stream/src/executor/monitor/streaming_stats.rs:257-264 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/meta/src/rpc/metrics.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ac8e6bd5556e077f17420c3e458f5a4a914de3825cb0a1b6f81833c7c4af2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:116-122 | src/meta/src/controller/catalog/drop_op.rs:32-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"242b2ecce5587c53a50b238fa1a009bad8d3e44a0f6eaddeea18e57f322edbf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/risedevtool/src/task/compactor_service.rs:36-43 | src/risedevtool/src/task/compute_node_service.rs:36-43 \u2014 before extracting anything, compare \u0060src/risedevtool/src/task/compactor_service.rs\u0060 and \u0060src/risedevtool/src/task/compute_node_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/task/compactor_service.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6d73f65f42b0e5389c76b347fb6d1d0b33849f3353b2648e3395c8ed78e87f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/src/hummock/sstable/block.rs:236-243 | src/storage/src/hummock/sstable/block.rs:246-253 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/hummock/sstable/block.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"25875f636535a6a0f3d8853dfc29b80ee31a6c2eb6e222aaec8ad1561cb8ccfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/src/hummock/sstable/xor_filter.rs:591-598 | src/storage/src/hummock/sstable/xor_filter.rs:607-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable/xor_filter.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e9d8c3513d66f978593488525491f906f3b69b02021bf6e0c1e4f8dddd96bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/src/mem_table.rs:231-238 | src/storage/src/mem_table.rs:266-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/mem_table.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e1412260879339ea8dc61979a5aadfb5736c723a1f325cb6054f62a8f377d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/src/mem_table.rs:317-324 | src/storage/src/mem_table.rs:332-339 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/mem_table.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7178d09ab6c8eacdf363bca3e55bb61f2cd529ddc6af16d9c3a589f0864e16da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/src/table/batch_table/mod.rs:98-105 | src/storage/src/table/batch_table/mod.rs:118-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/table/batch_table/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19e8eb465ef7c98c3a3918e5969a78c91fef37d8bdf8238fc50bdb19e1fa6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/stream/src/executor/dispatch/dispatch_sync_log_store.rs:354-361 | src/stream/src/executor/sync_kv_log_store.rs:783-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dispatch/dispatch_sync_log_store.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1009d3b48a17d342385754ce94142597922292ab74ed2e643fc5593cf56a315e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/stream/src/executor/over_window/eowc.rs:559-566 | src/stream/src/executor/over_window/general.rs:717-724 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/executor/over_window/eowc.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bc2829efd3519b7fa4de5763b6a3644df931731b8fdc4a686f6172f6cf4969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/stream/src/executor/over_window/over_partition.rs:920-927 | src/stream/src/executor/over_window/over_partition.rs:965-972 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/over_window/over_partition.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bd54b6cb16a1732ea06c78d5d50b6ae10654418c6255425420fbcc8c1e1dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 14): src/frontend/src/handler/alter_connection_props.rs:31-36 | src/frontend/src/handler/alter_mv.rs:41-47 | src/frontend/src/handler/alter_rename.rs:38-44 | src/frontend/src/handler/alter_rename.rs:82-88 | src/frontend/src/handler/alter_rename.rs:112-118 | src/frontend/src/handler/alter_rename.rs:141-147 | src/frontend/src/handler/alter_rename.rs:172-178 | src/frontend/src/handler/alter_rename.rs:203-209 | src/frontend/src/handler/alter_source_props.rs:37-42 | src/frontend/src/handler/alter_source_props.rs:141-146 | src/frontend/src/handler/alter_subscription_retention.rs:91-96 | src/frontend/src/handler/drop_index.rs:39-44 | src/frontend/src/handler/drop_mv.rs:36-42 | src/frontend/src/handler/drop_view.rs:33-39 \u2014 there are 14 copies across 8 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 14 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_connection_props.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"93562a8a6928bf5bd3262d73b70404dd4edacc130fd208c5adccea3901d61126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): src/connector/src/sink/iceberg/writer.rs:391-396 | src/connector/src/sink/iceberg/writer.rs:526-531 | src/connector/src/sink/iceberg/writer.rs:556-562 | src/connector/src/sink/iceberg/writer.rs:585-591 \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":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aaba75790790fd09114c72de1e442370c50695243600583c8289665f08a239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs:790-796 | src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs:829-835 | src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs:854-860 | src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs:873-879 \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":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d4e8ea63bdb8317785260ca329ac953a966f2cda9c035f131f83dccdea554d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/batch/executors/src/executor/hash_agg.rs:412-418 | src/batch/executors/src/executor/hash_agg.rs:439-445 | src/batch/executors/src/executor/order_by.rs:404-410 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/order_by.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"68919bf2a29a55e5e0886f4fcfd1911c20be0e9d5502521c560055b3b6a5b985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/batch/executors/src/executor/join/hash_join.rs:1256-1262 | src/batch/executors/src/executor/join/hash_join.rs:1387-1393 | src/batch/executors/src/executor/join/hash_join.rs:1505-1511 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b90551791592ff57a8be4e573da6c5ae818dd0f9fccdcd7e99d238593c5c850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/batch/src/task/broadcast_channel.rs:94-100 | src/batch/src/task/consistent_hash_shuffle_channel.rs:175-181 | src/batch/src/task/hash_shuffle_channel.rs:164-170 \u2014 before extracting anything, compare \u0060src/batch/src/task/consistent_hash_shuffle_channel.rs\u0060 and \u0060src/batch/src/task/hash_shuffle_channel.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/src/task/broadcast_channel.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf7b790477742675c0c1cce7d9988c15f198579e07727eb6ed366d60145c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/frontend/src/catalog/system_catalog/rw_catalog/rw_internal_tables.rs:62-68 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_subscriptions.rs:66-74 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_tables.rs:64-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_internal_tables.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2bec101380cbd362f7f6ee47396fb141b163ad3aa2006a9fc611039d30ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/frontend/src/optimizer/plan_node/stream_exchange.rs:115-121 | src/frontend/src/optimizer/plan_node/stream_iceberg_with_pk_index_position_delete_merger.rs:54-60 | src/frontend/src/optimizer/plan_node/stream_sync_log_store.rs:44-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/optimizer/plan_node/stream_exchange.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76c42e0f9416e3bb683305a4525891205805a782a428c7625afb8280139368f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/stream/src/executor/join/asof_join.rs:484-490 | src/stream/src/executor/join/asof_join.rs:544-550 | src/stream/src/executor/join/asof_join.rs:667-673 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/stream/src/executor/join/asof_join.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"7714e87989bda7bfb1cb66ca590168b7667533a74b5da926c03bd90d257ddc63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/batch/executors/src/executor/aggregation/orderby.rs:105-111 | src/frontend/src/datafusion/aggregate/orderby.rs:106-112 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/aggregation/orderby.rs\u0060 and \u0060src/frontend/src/datafusion/aggregate/orderby.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/aggregation/orderby.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"050be27e3a0d8cfaba699c79367f95855367362ea4d8d8b18ae3c7a7643fcb9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/batch/executors/src/executor/aggregation/orderby.rs:120-126 | src/frontend/src/datafusion/aggregate/orderby.rs:121-127 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/aggregation/orderby.rs\u0060 and \u0060src/frontend/src/datafusion/aggregate/orderby.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/aggregation/orderby.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99484085b1faa652933e53c900b54cb32011a60f14e7a09d6a34175179c0bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:364-370 | src/batch/executors/src/executor/order_by.rs:369-375 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/order_by.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7a8d691917ab526d15cefd416adf854d9ec692a1c2afe62f014be67a35d32b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/batch/executors/src/executor/join/hash_join.rs:383-389 | src/batch/executors/src/executor/join/hash_join.rs:410-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/hash_join.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"50721bcde1a363f94546dfbc45befc02b77dfcbaee100f1983c8b37ade68bb98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/batch/executors/src/executor/join/nested_loop_join.rs:286-292 | src/batch/executors/src/executor/join/nested_loop_join.rs:461-466 \u2014 both copies are in the same file, so extract the block into one function there 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/batch/executors/src/executor/join/nested_loop_join.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a34e1a0079a172cf0ff7a71c064607b969b654d441f3f06c6f84af03bd32ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/connector_common/iceberg/jni_catalog.rs:241-247 | src/connector/src/connector_common/iceberg/jni_catalog.rs:273-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":"src/connector/src/connector_common/iceberg/jni_catalog.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"07760d375d90e54f5db062d6d49d15aeb81c501e01a9514f0ee30090484c83ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/clickhouse.rs:197-203 | src/connector/src/sink/clickhouse.rs:211-217 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/clickhouse.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0953e408f6575c23be302f669c02d2cc0b9e87e7af3f7fdcb9d3ba9563ff67ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/clickhouse.rs:238-244 | src/connector/src/sink/clickhouse.rs:280-286 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/clickhouse.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4565ddb68742b65c17fee51c1639e051f46d46af2d0ca690bd0b83568dd9ee34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/clickhouse.rs:257-263 | src/connector/src/sink/clickhouse.rs:299-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/clickhouse.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5437bc541475e7964e7275046358e8be6e8d733cd22c707064365906ab22526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_client.rs:112-119 | src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_client.rs:141-147 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_client.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc209f2184bdc184a24341cab8baca152544ee291546635a0720d103e8b995c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/encoder/json.rs:397-403 | src/connector/src/sink/encoder/json.rs:415-421 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/encoder/json.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e257f93b29816ddeca04ec7620c0c4e38d82c362911d75d9a4f739f777458295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/iceberg/config.rs:192-198 | src/connector/src/sink/iceberg/config.rs:201-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":"src/connector/src/sink/iceberg/config.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a094ff2bcd182ba563bfd024d7de98e1913275ef75e497af1b0027dfffe2a6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/connector/src/source/cdc/external/mysql.rs:896-902 | src/connector/src/source/cdc/external/sql_server.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/cdc/external/mysql.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"058314d1fbbba970e0d7cf5061f724aceaebf4944d310cf95a37cd33089062f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/source/reader/reader.rs:203-209 | src/connector/src/source/reader/reader.rs:230-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/reader/reader.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac9b589d91dc23af3bdb924e4f4862710d31e81cb989cb8cb6bc11c8c146528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/expr/macro/src/gen.rs:1029-1035 | src/expr/macro/src/gen.rs:1040-1046 \u2014 both copies are in the same file, so extract the block into one function there 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/expr/macro/src/gen.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a747821ae4dc99a7bc97335f8fd1d6c2c6c3d4f25c4afe9ed64108a1c4854e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/binder/bind_context.rs:342-348 | src/frontend/src/binder/bind_context.rs:350-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/bind_context.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5e07b54a6f4475b77bd7c5061c29f0504e328cb0c1ec1834ba3ee3060cf764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/binder/insert.rs:401-407 | src/frontend/src/binder/insert.rs:432-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/insert.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e88ef1003da6f9d1ca1ce51a1553fcc173099cb19a5f244fbfc39e6fc1afdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/binder/relation/watermark.rs:38-44 | src/frontend/src/binder/relation/window_table_function.rs:57-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/watermark.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e9edc5cc51793d27fdbb9163866e3756680c1f4fb81b1932e76348a73e0a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/catalog/system_catalog/rw_catalog/rw_schemas.rs:34-40 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_system_tables.rs:36-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_schemas.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ded14be753bfd3c4f18ff7c34db53734387c1a24e25a36d1e285448b2702c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/frontend/src/handler/query.rs:90-95 | src/frontend/src/handler/query.rs:107-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":"src/frontend/src/handler/query.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf7fd455719e75c26a7c9b9899b4a3949768114db6f4cf4c09f6fc0f3e3efeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_filter.rs:82-88 | src/frontend/src/optimizer/plan_node/stream_filter.rs:62-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_filter.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcce764a9a0c6f70b253fde41f1d367de7c38a0ebab06d1761accca7fab6821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_gap_fill.rs:221-227 | src/frontend/src/optimizer/plan_node/logical_gap_fill.rs:230-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_gap_fill.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b14feeee9e1e1a592ad2575b7eb9c757c6a96eedf9197dc8de979a55c7e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_kafka_scan.rs:185-191 | src/frontend/src/optimizer/plan_node/logical_kafka_scan.rs:196-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_kafka_scan.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0983a27a2caf84de721c60de9c8c3e71e52ef348b0c7b287589ba30a2a17467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_exchange.rs:91-97 | src/frontend/src/optimizer/plan_node/stream_row_id_gen.rs:44-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_exchange.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3558ca6e7542c340cb2c455478e8147807c4add7dc4fc1255500be37640797d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_group_topn.rs:145-151 | src/frontend/src/optimizer/plan_node/stream_topn.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_group_topn.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b2b5fcc73f14569665aeb032673ca9394effe80045154ff4a8b5bcccdc7ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/webhook/websocket.rs:483-489 | src/frontend/src/webhook/websocket.rs:531-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/webhook/websocket.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d678f3a22da956fdb5047bfe6a6f51b36337103af463a5748e4ba9cfabce4206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/handler/drop_sink.rs:35-41 | src/frontend/src/handler/drop_subscription.rs:34-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/handler/drop_sink.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b669b0d4c5f801fd1b35d1ee91332436b01edcd7d1325c3c0d7109d27d95f6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/meta/src/controller/catalog/mod.rs:424-430 | src/meta/src/controller/streaming_job.rs:1743-1749 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"316e13f92d723f7b07503a2a448a71cf67feaa6f6213ef08cd92eda7c2e36bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/meta/src/controller/cluster.rs:738-744 | src/meta/src/controller/cluster.rs:806-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/cluster.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fc22776a298af0c69e44fc2300dc3b3bd4c01aa68ffa0e49f0f02bb626057b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:3117-3123 | src/meta/src/controller/streaming_job.rs:3199-3205 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f62dce6ee415b0f82b9a7ebf140805302d1d557288afb82fdcd46d519e7c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/meta/src/controller/streaming_job.rs:3129-3134 | src/meta/src/controller/streaming_job.rs:3223-3229 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ba0afeefa0677f9584fd1a03dba4c44bfbeff8427974d0497b5406c97e0a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/meta/src/controller/catalog/util.rs:107-112 | src/meta/src/controller/catalog/util.rs:131-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/util.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f82a79cbae7bc04cce9db46b1a9c6316541d1b5f2163b6da9684a7c3bac9578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/stream/src/executor/aggregate/agg_group.rs:282-288 | src/stream/src/executor/aggregate/agg_group.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/aggregate/agg_group.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"29983efbb961c3cdd2fc1522266d7c4b5263f1ec8e04ba60e35cce6e1dcb23f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/stream/src/executor/backfill/utils.rs:165-171 | src/stream/src/executor/backfill/utils.rs:178-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/utils.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33c8c911428b627e66940f1bf4a7438cd4a891cee9ebe5a8a68448c48ce9e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/stream/src/executor/eowc/eowc_gap_fill.rs:364-371 | src/stream/src/executor/gap_fill.rs:560-566 \u2014 before extracting anything, compare \u0060src/stream/src/executor/eowc/eowc_gap_fill.rs\u0060 and \u0060src/stream/src/executor/gap_fill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/eowc/eowc_gap_fill.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc1394757d59846eea016b45f8ccfd5649d49d142ccba3e458e50bf2597331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/stream/src/executor/join/asof_join.rs:589-595 | src/stream/src/executor/join/asof_join.rs:622-627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/join/asof_join.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"70259bcc8f7d72148e847729be61c8a2806e7836074a7bf53fa8a3cdc9c1afc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/stream/src/from_proto/source/trad_source.rs:345-353 | src/stream/src/from_proto/stream_scan.rs:214-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/stream/src/from_proto/source/trad_source.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da457936c2b2563b3a1ebe06e6c3f460cf168055ed5698154853faa6991e073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/stream/src/task/actor_manager.rs:580-586 | src/stream/src/task/actor_manager.rs:601-610 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/task/actor_manager.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c4892f69a6d4c962bba74665e09fdf42d6133e5175b5a1494e74daf252fd18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/utils/pgwire/src/pg_protocol.rs:1417-1423 | src/utils/pgwire/src/pg_protocol.rs:1430-1436 \u2014 both copies are in the same file, so extract the block into one function there 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/utils/pgwire/src/pg_protocol.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7683eb77e8d7b94f18c0fc072764130c3d97f59c53a1a808231d43629ad92b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 11): src/frontend/src/handler/alter_connection_props.rs:27-32 | src/frontend/src/handler/alter_set_schema.rs:37-41 | src/frontend/src/handler/alter_source_props.rs:33-38 | src/frontend/src/handler/alter_source_props.rs:137-142 | src/frontend/src/handler/alter_subscription_retention.rs:87-92 | src/frontend/src/handler/alter_swap_rename.rs:53-58 | src/frontend/src/handler/drop_connection.rs:32-37 | src/frontend/src/handler/drop_index.rs:36-40 | src/frontend/src/handler/drop_mv.rs:33-37 | src/frontend/src/handler/drop_subscription.rs:30-35 | src/frontend/src/handler/drop_view.rs:30-34 \u2014 there are 11 copies across 10 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 11 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_connection_props.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9fdbaaf983bebaaaf9bd4a41fe469de029703cc5bb547dffde1cdec441a134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): src/batch/executors/src/executor/hash_agg.rs:386-391 | src/batch/executors/src/executor/hash_agg.rs:409-414 | src/batch/executors/src/executor/hash_agg.rs:425-430 | src/batch/executors/src/executor/hash_agg.rs:436-441 | src/batch/executors/src/executor/join/hash_join.rs:352-357 | src/batch/executors/src/executor/join/hash_join.rs:380-385 | src/batch/executors/src/executor/join/hash_join.rs:396-401 | src/batch/executors/src/executor/join/hash_join.rs:407-412 | src/batch/executors/src/executor/order_by.rs:384-389 | src/batch/executors/src/executor/order_by.rs:401-406 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/join/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9894f5d2e26c8ca57d40363f6240075bba2de2f8aa8aa31288f1921e812d9664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 9): src/frontend/src/handler/alter_connection_props.rs:30-35 | src/frontend/src/handler/alter_source_props.rs:36-41 | src/frontend/src/handler/alter_source_props.rs:140-145 | src/frontend/src/handler/alter_subscription_retention.rs:90-95 | src/frontend/src/handler/drop_index.rs:39-43 | src/frontend/src/handler/drop_mv.rs:36-41 | src/frontend/src/handler/drop_sink.rs:35-39 | src/frontend/src/handler/drop_subscription.rs:33-38 | src/frontend/src/handler/drop_view.rs:33-38 \u2014 there are 9 copies across 8 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_connection_props.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2eaa109106da13725946c3238ecb52de4f6b01d7cfbd4aa5c57ebd151a2c9c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 6): src/frontend/src/handler/alter_mv.rs:40-44 | src/frontend/src/handler/alter_source_with_sr.rs:105-109 | src/frontend/src/handler/alter_table_column.rs:326-331 | src/frontend/src/handler/alter_utils.rs:63-66 | src/frontend/src/handler/drop_secret.rs:65-69 | src/frontend/src/handler/util.rs:330-335 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_mv.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb02ab05d74eb7fdc0296459dc4d6fcad98e38312526f2b32dc8af22711f685f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:75-80 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:98-103 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:120-125 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs:177-182 \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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_columns.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f5dde3d8ca61488e7a439520c22722c7658d012b7f372791ed220f7cd7f671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/connector/src/connector_common/iceberg/jni_catalog.rs:188-193 | src/connector/src/connector_common/iceberg/jni_catalog.rs:240-245 | src/connector/src/connector_common/iceberg/jni_catalog.rs:272-277 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/connector/src/connector_common/iceberg/jni_catalog.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7119370e39f2991f5c2037b6f1a56f7721150a2e3c09a8122577627f833c737e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/connector/src/source/cdc/external/postgres.rs:421-426 | src/connector/src/source/cdc/external/postgres.rs:444-449 | src/connector/src/source/cdc/external/postgres.rs:455-460 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/connector/src/source/cdc/external/postgres.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"2290f585c1c64062230559e8e0a717d901b4dee523897cc6d687df6f7461b0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/frontend/src/session.rs:1222-1227 | src/frontend/src/session.rs:1267-1272 | src/frontend/src/session.rs:1315-1320 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/session.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f44d6a6dba18495e74c5a03716b3ec89cb6680ed1f735456dc82d26d5653be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/stream/src/executor/dml.rs:199-204 | src/stream/src/executor/source/fs_fetch_executor.rs:443-448 | src/stream/src/executor/source/iceberg_fetch_executor.rs:391-396 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/fs_fetch_executor.rs\u0060 and \u0060src/stream/src/executor/source/iceberg_fetch_executor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dml.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e2076371181d523d442074449882c3196dfe2dc596accf11d16a6eb48f269d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/batch/executors/src/executor/iceberg_scan.rs:186-191 | src/batch/executors/src/executor/source.rs:98-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/batch/executors/src/executor/iceberg_scan.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e529fc60c87c94d286063cdcbc63236280ed97285a619536f95d87ff48336a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/common/heap_profiling/src/profile_service.rs:128-133 | src/common/heap_profiling/src/profile_service.rs:141-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":"src/common/heap_profiling/src/profile_service.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7124851666e7731823ebe48cee24e50fef332183e5ec97219a75f4a0857df62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/connector/src/connector_common/iceberg/jni_catalog.rs:317-322 | src/connector/src/connector_common/iceberg/jni_catalog.rs:375-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/connector_common/iceberg/jni_catalog.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9577857032cda2a0fc483615c67129687b8b93b0d2056cac9474d540f01eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/connector/src/parser/unified/debezium.rs:1361-1366 | src/connector/src/parser/unified/debezium.rs:1396-1401 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/parser/unified/debezium.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2847d2fca4dabf6b61ee108f48aa261a7be6dfe9e0fd07de422cbccef16903a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/connector/src/source/pulsar/source/reader.rs:406-411 | src/connector/src/source/pulsar/source/reader.rs:446-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/pulsar/source/reader.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cacb3a1e65258c5dd167aa1401ae53caef245c09256b3049fbb1c56e707bae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/expr/core/src/expr/expr_udf.rs:62-67 | src/expr/core/src/table_function/user_defined.rs:52-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/expr/core/src/expr/expr_udf.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d28241367af1d8749075892cdc01281b8a3562778efa74eeb66fe11eb77e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/expr/macro/src/lib.rs:427-432 | src/expr/macro/src/lib.rs:455-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/macro/src/lib.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9753accd56eb8180ec6133680ce093f0ceb75b00786685e5441c3693a212fa6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/expr/macro/src/lib.rs:473-478 | src/expr/macro/src/lib.rs:491-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/macro/src/lib.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27a7fb4fcafab5b981cfb96f89cbc99dd899f1b8cfb44a2f4f60a3c0602c127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/expr/macro/src/gen.rs:342-347 | src/expr/macro/src/gen.rs:352-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":"src/expr/macro/src/gen.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ddc567ee804f8dae0bdd779e4ff11a9feb3be3d6f339149dbc4ecbf842328b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/expr/macro/src/gen.rs:777-783 | src/expr/macro/src/gen.rs:1146-1151 \u2014 both copies are in the same file, so extract the block into one function there 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/expr/macro/src/gen.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a923b10075b829e8e9c60abca5d6000a0a5891d42d83e30e9d16e20eeea191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/expr/table_function.rs:187-192 | src/frontend/src/optimizer/rule/table_function_to_file_scan_rule.rs:72-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/table_function.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"932084a814188cf17cde6bfaf220f7baf6a8e2944ba2ab4ca3429384a1ddd982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_simple_agg.rs:121-126 | src/frontend/src/optimizer/plan_node/stream_stateless_simple_agg.rs:95-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_simple_agg.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cb435f3260f6e78043a2f72c1e01f5a583adb520e34aba63abcb929eb8597c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:611-616 | src/frontend/src/optimizer/rule/index_selection_rule.rs:739-744 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bc307358edc471df9fc5ed97bf92f08bdff197f6dc87a9ab2fc0d46316bdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/scheduler/distributed/stage.rs:407-416 | src/frontend/src/scheduler/distributed/stage.rs:434-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":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0347bdf674f9b3089a2a4e85bc715eca2d51e118996ce3bad8f64f5a22952f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/frontend/src/planner/relation.rs:661-665 | src/frontend/src/planner/relation.rs:687-692 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/planner/relation.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c80e7f133fdb7c3c872446bbfd8d335e2aec369ce4c7572dcc721bfee2b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/jni_core/src/lib.rs:1104-1109 | src/jni_core/src/lib.rs:1228-1233 \u2014 both copies are in the same file, so extract the block into one function there 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/jni_core/src/lib.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6ef854bcfa9e6118b8571c1e6e6c9102fe340fd0daab90e2808fe8657b09f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/meta/src/manager/diagnose.rs:169-174 | src/meta/src/manager/diagnose.rs:969-974 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/manager/diagnose.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a84ea585d53ed70224523811987df5c4f30d06d5ab2197386908cc46066678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/meta/src/controller/catalog/util.rs:100-105 | src/meta/src/controller/catalog/util.rs:321-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":"src/meta/src/controller/catalog/util.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"325720afd3bbca6a7a3e658bd646c66a43b19ad191264d486c45e3ccd314915c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/sqlparser/src/parser.rs:5784-5790 | src/sqlparser/src/parser.rs:6840-6845 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/parser.rs"},"region":{"startLine":5784}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abb0fba5fa30036b1fa56cc5ff9c13feef03db29a3d4064100e1b4f5cb72a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/storage/src/mem_table.rs:265-270 | src/storage/src/mem_table.rs:331-336 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/src/mem_table.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"369abde9ea11dcb1c35b41c6d319d1fba62016bee595a0b62d9a9c315ffc3483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/stream/src/executor/dynamic_filter.rs:238-243 | src/stream/src/executor/dynamic_filter.rs:247-252 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/dynamic_filter.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fefae7630af6cfd041bd67703d54cdce4d87fe2a01ef2561f1e168820c9259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:188-193 | src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs:236-240 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f9e5951673a61f3de188e51dbd0442da4f664aa27d95472d0e443dccd6498f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/stream/src/executor/top_n/group_top_n.rs:202-207 | src/stream/src/executor/top_n/group_top_n_appendonly.rs:185-190 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/group_top_n.rs\u0060 and \u0060src/stream/src/executor/top_n/group_top_n_appendonly.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/group_top_n.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92e6609ac19ad9b7eaef49e6c0155524e5293f355eda3c07250c825064743a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/stream/src/executor/over_window/frame_finder.rs:414-419 | src/stream/src/executor/over_window/frame_finder.rs:434-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":"src/stream/src/executor/over_window/frame_finder.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da1d40e3188306c86ce08fd21320721cc306eff2c14caa63d6f125b91950313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/meta/src/controller/catalog/mod.rs:1119-1127 | src/meta/src/controller/catalog/mod.rs:1279-1283 | src/meta/src/controller/catalog/mod.rs:1311-1319 | src/meta/src/controller/catalog/mod.rs:1323-1330 | src/meta/src/controller/catalog/mod.rs:1334-1342 \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":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ceb70aa41562fda931ed844266bb44937f82062b6d07fe610cd097e91a2b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/risedevtool/src/bin/risedev-dev.rs:185-190 | src/risedevtool/src/bin/risedev-dev.rs:195-199 | src/risedevtool/src/bin/risedev-dev.rs:206-210 | src/risedevtool/src/bin/risedev-dev.rs:215-219 \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":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"61852c6b63e510f3789b6b199cb0f1d43c0ec000b164ee53662d8a4ff8c5a8ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/storage/src/mem_table.rs:231-235 | src/storage/src/mem_table.rs:266-270 | src/storage/src/mem_table.rs:317-321 | src/storage/src/mem_table.rs:332-336 \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":"src/storage/src/mem_table.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8054646ed877be9b3ebf2e3803a5a3e62f4e03ff0d2d9cb611c12bc991deca4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/frontend/src/optimizer/plan_node/batch_delete.rs:62-66 | src/frontend/src/optimizer/plan_node/batch_insert.rs:74-78 | src/frontend/src/optimizer/plan_node/batch_update.rs:65-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_delete.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"55450a67544b446da87626070f8a54db249758ca57a94697abd305657b74caa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/frontend/src/optimizer/plan_node/stream_hash_agg.rs:200-204 | src/frontend/src/optimizer/plan_node/stream_simple_agg.rs:122-126 | src/frontend/src/optimizer/plan_node/stream_stateless_simple_agg.rs:96-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_hash_agg.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaadeadfaadeb3ea1abc2839f74b694c1d90a070bbaa525ae897166ca57379e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/risedevtool/src/bin/risedev-dev.rs:176-180 | src/risedevtool/src/bin/risedev-dev.rs:224-228 | src/risedevtool/src/bin/risedev-dev.rs:429-434 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c204d0537f8bcac2c3c6c8577a8a8c678696722a13e02531211b4b3d8e69025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/stream/src/executor/top_n/top_n_state.rs:179-184 | src/stream/src/executor/top_n/top_n_state.rs:251-255 | src/stream/src/executor/top_n/top_n_state.rs:283-287 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/stream/src/executor/top_n/top_n_state.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae9e9bdac75f06d1a5dcb0d3fd9138c9687556910753846510fb4d5f4f25167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): src/common/src/array/arrow/arrow_iceberg.rs:146-150 | src/common/src/array/arrow/arrow_iceberg.rs:518-521 | src/common/src/array/arrow/arrow_impl.rs:382-386 \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":"src/common/src/array/arrow/arrow_iceberg.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7043125acef647f238fc9783668258bf2ac0f6f584c9829775deaa5b0e0d713f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/connector/src/sink/doris_starrocks_connector.rs:245-249 | src/connector/src/sink/doris_starrocks_connector.rs:505-509 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/doris_starrocks_connector.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace53942e96d5ebd2ea098c17dede3a6bbe538551418cdf7371c3982debb32a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/connector/src/sink/snowflake_redshift/redshift.rs:726-730 | src/connector/src/sink/snowflake_redshift/redshift.rs:763-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/snowflake_redshift/redshift.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ba0f887e442eaf7e3618de056c3a5234ff41028196fa60300dec1fedbbae18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/expr/core/src/aggregate/def.rs:183-187 | src/expr/core/src/aggregate/def.rs:202-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/core/src/aggregate/def.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"19282540877e1254c727d4aa44cd35cacdad7fe886f7d83132503e05eb10764a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:212-216 | src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs:231-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":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_relation_info.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68726e0d407bc2c3bf14c8929a34b10549b3f62d48bf8558fa2865fe77611cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/expr/utils.rs:342-346 | src/frontend/src/expr/utils.rs:355-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/utils.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6917a93343db7a965dd8755fd4ec2113130f70937de6db56b632a8fe613fbc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/observer/observer_manager.rs:260-264 | src/frontend/src/observer/observer_manager.rs:281-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":"src/frontend/src/observer/observer_manager.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d0883678dbab075f89b5defc9982374c30cc446a2a67c8e30bd3034f160799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_hash_join.rs:237-241 | src/frontend/src/optimizer/plan_node/batch_nested_loop_join.rs:128-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_hash_join.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb4b5e568f75165555b508cf7cea3b14c527fd0a808f812dfc3f5ff84cd3d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_log_seq_scan.rs:90-94 | src/frontend/src/optimizer/plan_node/stream_cdc_table_scan.rs:131-135 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/batch_log_seq_scan.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3000a9ce0eefc5dd89702cb6bf4760dad09ad568c6d8813caf32c8a5397afb05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:257-261 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:343-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":"src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344525374181e027d1a40309d70a7c6c1ba81089a77bc77ded10fa2b3e7809c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:389-393 | src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs:560-564 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/optimizer/rule/apply_join_transpose_rule.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bbfab63ae05871c9c3b2d621cf1cd4f96862310a3fa9a3c6a73a9e2ec57260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/meta/src/hummock/compaction/picker/manual_compaction_picker.rs:302-307 | src/meta/src/hummock/compaction/picker/min_overlap_compaction_picker.rs:152-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/meta/src/hummock/compaction/picker/manual_compaction_picker.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"522eda61c52d488258ec1ea8cfc988226a79117236e5764b0efb8888ce6ab245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/meta/src/controller/catalog/util.rs:649-653 | src/meta/src/controller/catalog/util.rs:659-663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/util.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434d5287908e21298b79d5a95d0ed2501ddd81aa22b93b703399729cccd1931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/object_store/src/object/mem.rs:232-236 | src/object_store/src/object/sim/mod.rs:102-106 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/object_store/src/object/mem.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f47c3e3335a610b758b8c0d01c1ba53ec6bea5f6cc6ec9eace352f9f5ebc89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/sqlparser/src/parser.rs:2484-2488 | src/sqlparser/src/parser.rs:2503-2507 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/parser.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fcf769c73193eb04b0c989d322360f2beee1a549f206009c8a0a1019a817a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/storage/hummock_sdk/src/key.rs:242-246 | src/storage/hummock_sdk/src/key.rs:273-277 \u2014 both copies are in the same file, so extract the block into one function there 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/storage/hummock_sdk/src/key.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"75541537f0e48bed9d9416a8ba9dfaa209f8f6e12dae78d85d9327030ef2c6cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/storage/src/hummock/compactor/compaction_utils.rs:302-306 | src/storage/src/hummock/compactor/shared_buffer_compact.rs:380-384 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/compaction_utils.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a8eee1149d60a1fa76c15ed6b8af37392c6dd587d46cf7aa7d07b5c52d67e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/common/table/state_table.rs:1309-1313 | src/stream/src/common/table/state_table.rs:1366-1370 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/common/table/state_table.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec241151ee91b65c596a213528440b93fa1b638a916b34ed4805f6e83ada6178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/approx_percentile/local.rs:69-73 | src/stream/src/executor/approx_percentile/local.rs:76-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/approx_percentile/local.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2919701811dab885a77bb6232d71f76074f2906540acc0113eb9b56ffeed66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/backfill/utils.rs:139-143 | src/stream/src/executor/backfill/utils.rs:150-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":"src/stream/src/executor/backfill/utils.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab206904bea6af8b182d18e0b2cd8db1c0fde8bd2361186ebb3a7ad9db684943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/iceberg_with_pk_index/compaction_resolver.rs:411-415 | src/stream/src/executor/iceberg_with_pk_index/compaction_resolver.rs:456-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/iceberg_with_pk_index/compaction_resolver.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"820daf4c0a434d45925e350c6f8ad0a91b43058c5b7e994589778e0f1a7c1b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/iceberg_with_pk_index/compaction_resolver.rs:426-430 | src/stream/src/executor/iceberg_with_pk_index/compaction_resolver.rs:472-476 \u2014 both copies are in the same file, so extract the block into one function there 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/stream/src/executor/iceberg_with_pk_index/compaction_resolver.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea470925e56615c3c0286fc675473f23cdbe695dfd4297a07c9ccee86e7fa45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/batch/executors/src/executor/aggregation/orderby.rs:63-75 | src/frontend/src/datafusion/aggregate/orderby.rs:64-76 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/aggregation/orderby.rs\u0060 and \u0060src/frontend/src/datafusion/aggregate/orderby.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/aggregation/orderby.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d8bd972ff4751cff0840334cd7dcd2b805799ffbd9b5743f4f577bc0be9017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:462-466 | src/batch/executors/src/executor/order_by.rs:418-422 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/order_by.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2392eeabbd54cc7c900e815c058ac168ed39df856a3e632195779d6aff5a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/batch/executors/src/executor/order_by.rs:300-313 | src/batch/executors/src/executor/top_n.rs:92-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/batch/executors/src/executor/order_by.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d5b08f52396523647a5629656e338108fe098d5bd0ead78cd56449fc9fc3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/batch/executors/src/executor/project_set.rs:208-213 | src/stream/src/executor/project/project_set.rs:362-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":"src/batch/executors/src/executor/project_set.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c81f36b79a35e814f260dd4a40b63b9d194b34f79e4b0f751e7147a0f8c32f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/batch/src/task/broadcast_channel.rs:57-66 | src/batch/src/task/consistent_hash_shuffle_channel.rs:136-145 | src/batch/src/task/hash_shuffle_channel.rs:132-141 \u2014 before extracting anything, compare \u0060src/batch/src/task/consistent_hash_shuffle_channel.rs\u0060 and \u0060src/batch/src/task/hash_shuffle_channel.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/src/task/broadcast_channel.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d37afc5ed05f9d5344c33f985968894537a7f80cbfa180d7ffcbb508bfe1cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/batch/src/task/consistent_hash_shuffle_channel.rs:149-155 | src/batch/src/task/hash_shuffle_channel.rs:145-151 \u2014 before extracting anything, compare \u0060src/batch/src/task/consistent_hash_shuffle_channel.rs\u0060 and \u0060src/batch/src/task/hash_shuffle_channel.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/src/task/consistent_hash_shuffle_channel.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"007a50815ced04b7435c7543a35f6d97af66d187934a7d7935c56fa27cb0e842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/common/src/array/bool_array.rs:52-59 | src/common/src/array/bytes_array.rs:115-122 | src/common/src/array/num256_array.rs:157-164 | src/common/src/array/primitive_array.rs:143-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/array/bool_array.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"18defef43fb5aeac045247f31b87b246fc5efc3cdeebf7550b7fe5ffbb82ec4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/common/src/array/num256_array.rs:133-138 | src/common/src/array/primitive_array.rs:304-309 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/common/src/array/num256_array.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"981d52c01afe585676c58dc4ba3f5c5fdc1b000ffadb7d36d928369bbbfd1e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/common/src/session_config/parallelism.rs:277-286 | src/meta/model/migration/src/m20260311_000000_legacy_streaming_parallelism_session_params.rs:445-454 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/common/src/session_config/parallelism.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed91adc58eb56b522c2b39d6aa5150ceeda64d3a79495569cb2691963a626c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/connector/src/parser/mod.rs:222-231 | src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs:50-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f01f7678f858e2cd35fc709c9695056b52352cf573dc2af6460f410b12b7d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/connector/src/sink/elasticsearch_opensearch/elasticsearch.rs:90-99 | src/connector/src/sink/elasticsearch_opensearch/opensearch.rs:90-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/elasticsearch_opensearch/elasticsearch.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"404cabb4c2fbc77e781efcf60a5fd43741f44dff21ab3100e8b43df186048c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/connector/src/sink/iceberg/mod.rs:216-225 | src/connector/src/sink/lancedb.rs:176-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/connector/src/sink/iceberg/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"68591896569bca39d43ee4fd58b1f5b2a01c3f0bac9d3dd26f376ea6876f23d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/connector/src/sink/snowflake_redshift/redshift.rs:357-362 | src/connector/src/sink/snowflake_redshift/snowflake.rs:628-633 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/connector/src/sink/snowflake_redshift/redshift.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c857735b338352ec919f39d2e13d4eb9f0f0bda4a4c403ac2a694f64c31fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/connector/src/sink/snowflake_redshift/redshift.rs:364-369 | src/connector/src/sink/snowflake_redshift/snowflake.rs:635-640 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/connector/src/sink/snowflake_redshift/redshift.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b35858fe695884d6e7e56d89f35399cde2dc9311b2bcaff3c63630fa1a49e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/connector/src/source/cdc/source/reader.rs:216-220 | src/connector/src/source/google_pubsub/source/reader.rs:156-160 | src/connector/src/source/kinesis/source/reader.rs:168-172 | src/connector/src/source/mqtt/source/reader.rs:83-87 | src/connector/src/source/nats/source/reader.rs:116-120 | src/connector/src/source/pulsar/source/reader.rs:296-300 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/cdc/source/reader.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d9c11fa628e2d861f43bf43febe0fd59ecfa388bcc422d5a6f414e857733c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/connector/src/with_options.rs:339-346 | src/frontend/src/utils/with_options.rs:200-207 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/connector/src/with_options.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d1ff66863e6ee166713d0755bee374b708a6466253f9c53ad42d62c53b6ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/expr/impl/src/aggregate/percentile_cont.rs:98-104 | src/expr/impl/src/aggregate/percentile_disc.rs:123-129 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/aggregate/percentile_cont.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"956118d04d77d14aa5b42919e62b6866746079e71db8ab730f7f8610eaa91d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/expr/impl/src/aggregate/percentile_cont.rs:111-117 | src/expr/impl/src/aggregate/percentile_disc.rs:136-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/aggregate/percentile_cont.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb204d59721fe9f97924aaaf12f4e0587b077adae50b791605ff8c43a01c7e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/expr/impl/src/scalar/jsonb_delete.rs:398-407 | src/expr/impl/src/scalar/jsonb_set.rs:178-187 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/expr/impl/src/scalar/jsonb_delete.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f920c5da1e6bdcc9e16862f4f47456e42f64d7e761abd89ad09fac7b15148d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/catalog/source_catalog.rs:130-134 | src/frontend/src/catalog/table_catalog.rs:293-297 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/catalog/source_catalog.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf15e55c71a75e52f73cda85ea904752eebccaf802f73f127a583f2423deffcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/datafusion/expand.rs:112-120 | src/frontend/src/datafusion/project_set.rs:192-200 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/datafusion/expand.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420aef4d59604e6a73bd1744b15f83c3885798c23f739cf5af8d924beba6258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/datafusion/expand.rs:125-132 | src/frontend/src/datafusion/project_set.rs:205-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/datafusion/expand.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7659e74baedde1206f020e9af9f72c2c855ee1c3bf24484a955b7be5e3c5efee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/expr/utils.rs:120-127 | src/frontend/src/optimizer/rule/logical_filter_expression_simplify_rule.rs:62-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/utils.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a19db8074fa2f2e15bdf9df05508a2d3996e62d03b9d64a30e0b1472f02cd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/frontend/src/optimizer/plan_node/batch_delete.rs:98-102 | src/frontend/src/optimizer/plan_node/batch_insert.rs:128-132 | src/frontend/src/optimizer/plan_node/batch_max_one_row.rs:84-88 | src/frontend/src/optimizer/plan_node/batch_update.rs:111-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_delete.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88c99d1c6428334c83e213a4ab0e7a9e625cc4978cfb13049cd618abc5d7412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_file_scan.rs:47-55 | src/frontend/src/optimizer/plan_node/batch_source.rs:66-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_file_scan.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"099020a92159ad8dfa856a47a498c4df33829e37b7128e891773e1484abfabac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): src/frontend/src/optimizer/plan_node/batch_filter.rs:101-105 | src/frontend/src/optimizer/plan_node/batch_hash_agg.rs:164-168 | src/frontend/src/optimizer/plan_node/batch_nested_loop_join.rs:140-144 | src/frontend/src/optimizer/plan_node/batch_project.rs:115-119 | src/frontend/src/optimizer/plan_node/batch_project_set.rs:98-102 | src/frontend/src/optimizer/plan_node/batch_simple_agg.rs:153-157 | src/frontend/src/optimizer/plan_node/batch_table_function.rs:77-81 | src/frontend/src/optimizer/plan_node/batch_values.rs:101-105 | src/frontend/src/optimizer/plan_node/stream_filter.rs:118-122 | src/frontend/src/optimizer/plan_node/stream_project_set.rs:149-153 | src/frontend/src/optimizer/plan_node/stream_values.rs:89-93 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 11 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_filter.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe696e8d65d1eab9c99b4631ba28ea9d67b9cfc8765c65181880c11f9cb4d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_hash_agg.rs:149-156 | src/frontend/src/optimizer/plan_node/batch_simple_agg.rs:138-145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/batch_hash_agg.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"76eead360ae6ab9dba87f9fe684d32150dde7aa8cfee47cf88c67093862009d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_hop_window.rs:80-88 | src/frontend/src/optimizer/plan_node/stream_hop_window.rs:93-101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/batch_hop_window.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b6bc9066b38ea52a61773dad95c0314065a836dbb74fee649b7ac906de4483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_mysql_query.rs:46-52 | src/frontend/src/optimizer/plan_node/batch_postgres_query.rs:46-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_mysql_query.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0aea007b8c9839324fa924c675fe34dccb6e9ee5252af2c98ae2c3156ac9b56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs:131-136 | src/frontend/src/optimizer/plan_node/generic/table_scan.rs:102-107 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/generic/table_scan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e747d8c5c530ef14266bb675503169f3a2be26b5c39b0d38690c974297cc870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs:157-162 | src/frontend/src/optimizer/plan_node/generic/sys_scan.rs:52-57 | src/frontend/src/optimizer/plan_node/generic/table_scan.rs:171-176 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/generic/table_scan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01057eb6adcebd33d971dae4ec982c9a2ebcbfd0dc0427c906dfaeeaa1bb94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs:173-182 | src/frontend/src/optimizer/plan_node/generic/table_scan.rs:225-234 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/generic/table_scan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6ca9b97dcfa927ffa847e3c00b9416f9f7353c4fedf998111d8db8bd08f78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs:201-211 | src/frontend/src/optimizer/plan_node/generic/log_scan.rs:122-132 | src/frontend/src/optimizer/plan_node/generic/sys_scan.rs:94-104 | src/frontend/src/optimizer/plan_node/generic/table_scan.rs:361-371 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/generic/table_scan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15d8f7db57e2d2a2aeb1b32c2b8c350a08a84a1f83cfaaf754c293c04af6d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs:244-251 | src/frontend/src/optimizer/plan_node/generic/sys_scan.rs:133-140 | src/frontend/src/optimizer/plan_node/generic/table_scan.rs:420-427 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/generic/table_scan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/cdc_scan.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"442d9815cf174677a8c6ceedce2853b9ebdcc1afaefc4982e532bf66e53296e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/sys_scan.rs:149-154 | src/frontend/src/optimizer/plan_node/generic/table_scan.rs:440-445 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/generic/sys_scan.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/generic/table_scan.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":"src/frontend/src/optimizer/plan_node/generic/sys_scan.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ad7479aeacd5635d44c052222d5602998e8dd7daae02f06d857ebe01eedce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): src/frontend/src/optimizer/plan_node/logical_agg.rs:1231-1239 | src/frontend/src/optimizer/plan_node/logical_filter.rs:168-176 | src/frontend/src/optimizer/plan_node/logical_join.rs:720-728 | src/frontend/src/optimizer/plan_node/logical_project.rs:179-187 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:302-310 | src/frontend/src/optimizer/plan_node/logical_scan.rs:457-465 | src/frontend/src/optimizer/plan_node/stream_eowc_gap_fill.rs:195-203 | src/frontend/src/optimizer/plan_node/stream_gap_fill.rs:193-201 | src/frontend/src/optimizer/plan_node/stream_match_recognize.rs:278-286 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_project.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_project_set.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f068e9d2fd0c4d9156aa3e350af1a285d39863bd90744c1e1755cedc1bf511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_cdc_scan.rs:195-200 | src/frontend/src/optimizer/plan_node/logical_source.rs:500-505 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/logical_cdc_scan.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d57d2be1f8d236eeec44bfdc2f9de054f9d8b68a1777905894d24c161ef5a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/frontend/src/optimizer/plan_node/logical_changelog.rs:256-260 | src/frontend/src/optimizer/plan_node/logical_expand.rs:190-194 | src/frontend/src/optimizer/plan_node/logical_filter.rs:220-224 | src/frontend/src/optimizer/plan_node/logical_locality_provider.rs:155-159 | src/frontend/src/optimizer/plan_node/logical_max_one_row.rs:118-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_changelog.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b828acbbdae62c2b6c556838bc24258faf1c84d0be1b964f3e750936e57b9c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/frontend/src/optimizer/plan_node/logical_except.rs:70-77 | src/frontend/src/optimizer/plan_node/logical_intersect.rs:69-76 | src/frontend/src/optimizer/plan_node/logical_union.rs:91-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/optimizer/plan_node/logical_except.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b119164a3223ce97d3d4106087914175084e4c038451d07ad0cbd51c907b8656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/frontend/src/optimizer/plan_node/logical_except.rs:89-96 | src/frontend/src/optimizer/plan_node/logical_intersect.rs:88-95 | src/frontend/src/optimizer/plan_node/logical_union.rs:110-117 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_except.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb26145400b2f98f4f20c10142c5422af1a36e5ea5d1db55f579958634d29ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/frontend/src/optimizer/plan_node/logical_table_function.rs:81-85 | src/frontend/src/optimizer/plan_node/logical_values.rs:99-103 | src/frontend/src/optimizer/plan_node/logical_vector_search.rs:241-245 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/optimizer/plan_node/logical_table_function.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2860ba84f731885e63321714800bab40d6752a87de1b077af8adb86d0e1e2ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_delta_join.rs:141-146 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:602-607 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_delta_join.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60c201753137f54f705026251b9c898c0ad73e37f3cb6296c50bd3bb6116de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/frontend/src/optimizer/plan_node/stream_delta_join.rs:237-241 | src/frontend/src/optimizer/plan_node/stream_hash_join.rs:730-734 | src/frontend/src/optimizer/plan_node/stream_stateless_simple_agg.rs: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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_delta_join.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d537cd56252b5a5024d39aac55168694bee0fdfd12b2b9302ba9d5a5500620d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/frontend/src/optimizer/plan_node/stream_over_window.rs:150-154 | src/frontend/src/optimizer/plan_node/stream_stateless_simple_agg.rs:81-85 | src/frontend/src/optimizer/plan_node/stream_topn.rs:97-101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/optimizer/plan_node/stream_over_window.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5770edc5fe61ef6ae1fb04708b6bc78834d356e12912657138797d431f78ede9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/rule/table_function_to_internal_backfill_progress.rs:153-158 | src/frontend/src/optimizer/rule/table_function_to_internal_source_backfill_progress.rs:120-125 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/rule/table_function_to_internal_backfill_progress.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d154e0d94a1dff9024f9e715a84b81549a0313e6ba1691b8a1f963a959fac2bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/object_store/src/object/mem.rs:315-320 | src/object_store/src/object/sim/service.rs:145-150 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/object_store/src/object/mem.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d426392454b9852e509dfd7e7fafbe59a49643dae88baa36bf8649af62d151c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/storage/compactor/src/compactor_observer/observer_manager.rs:99-112 | src/storage/src/hummock/observer_manager.rs:207-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/storage/compactor/src/compactor_observer/observer_manager.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90f0dd75e7ee8a8f287548c5d5a83b3185dc9c013da45590fe643186514dedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/storage/hummock_test/src/bin/replay/replay_impl.rs:357-362 | src/storage/hummock_test/src/mock_notification_client.rs:106-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_test/src/bin/replay/replay_impl.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"75723d06fe58541783064d1c3ec23b9b1595eb5a092576c23dc60f3bd321aa93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/src/hummock/iterator/change_log.rs:164-171 | src/storage/src/hummock/iterator/forward_user.rs:248-255 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/storage/src/hummock/iterator/change_log.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a802564f589abf2a38dbf2264c07361739289b58f5dd9cf72006739a4b2bfe01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/storage/src/hummock/sstable/backward_sstable_iterator.rs:190-194 | src/storage/src/hummock/sstable/forward_sstable_iterator.rs:321-325 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/storage/src/hummock/sstable/backward_sstable_iterator.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3d74346fa3f3989725e8defbe631fe04d7921f45c3555c5a48bd6da3dd0113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/storage/src/hummock/store/local_hummock_storage.rs:410-417 | src/storage/src/memory.rs:1080-1086 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/storage/src/hummock/store/local_hummock_storage.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee911bf72360dd3e5374576b5a794d9004dce8eebcff8e82f0776ebca9465831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/aggregate/hash_agg.rs:131-135 | src/stream/src/executor/aggregate/simple_agg.rs:93-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/aggregate/hash_agg.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a226d745f7fbea18031d853adfd4f9c53e1cb67e7875d355262cba47092af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/asof_join.rs:513-517 | src/stream/src/executor/hash_join.rs:784-790 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e046128bb1db7c64081dc28d3590f1d7facd9226f131240250ddf98dd21691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/asof_join.rs:519-523 | src/stream/src/executor/hash_join.rs:792-798 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59c6da7738dd4be8795a743a63fc30a1447da948034433ac647889c5f82ba4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/top_n/group_top_n.rs:270-283 | src/stream/src/executor/top_n/group_top_n_appendonly.rs:240-253 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/group_top_n.rs\u0060 and \u0060src/stream/src/executor/top_n/group_top_n_appendonly.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/group_top_n.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"71281d28e579fa2db072c12744777ad7d5ed897de28ad6ac3e4b09a7389f8c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/stream/src/executor/top_n/top_n_appendonly.rs:155-160 | src/stream/src/executor/top_n/top_n_plain.rs:194-199 \u2014 before extracting anything, compare \u0060src/stream/src/executor/top_n/top_n_appendonly.rs\u0060 and \u0060src/stream/src/executor/top_n/top_n_plain.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/top_n/top_n_appendonly.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7189cc299ae2df397449a399070b6cc32e870eb479c25557710905879f43b7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/compute/src/telemetry.rs:61-66 | src/frontend/src/telemetry.rs:82-87 | src/storage/compactor/src/telemetry.rs:77-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/telemetry.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"74648e57a577135d85e34e27165d141231cd9ed6d6c3ff22abdcc982ebfd0825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/connector/src/sink/big_query.rs:648-653 | src/connector/src/sink/doris.rs:307-312 | src/connector/src/sink/postgres.rs:217-222 | src/connector/src/sink/sqlserver.rs:166-171 \u2014 before extracting anything, compare \u0060src/connector/src/sink/doris.rs\u0060 and \u0060src/connector/src/sink/sqlserver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/big_query.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00de75f6221a2e7a9471b3bf3f19e0c2c02de1375aa444bbd7c6748a31f36ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/connector/src/sink/doris.rs:261-270 | src/connector/src/sink/sqlserver.rs:274-283 \u2014 before extracting anything, compare \u0060src/connector/src/sink/doris.rs\u0060 and \u0060src/connector/src/sink/sqlserver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/doris.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce0e5da84882daadcf62e59f6b0dfc9ca6fffbc37fcc959969cf3a52b5c7733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/connector/src/sink/elasticsearch_opensearch/elasticsearch.rs:52-62 | src/connector/src/sink/elasticsearch_opensearch/opensearch.rs:53-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/elasticsearch_opensearch/elasticsearch.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8386fa6ed0a4e6f674beb6ae05e21255a9c531f7131263e556131f6f3229525d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_config.rs:173-178 | src/connector/src/sink/kafka.rs:272-277 | src/connector/src/sink/kinesis.rs:158-163 | src/connector/src/sink/pulsar.rs:200-205 | src/connector/src/sink/redis.rs:254-259 \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":"src/connector/src/sink/elasticsearch_opensearch/elasticsearch_opensearch_config.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb13d6be316f74180f0489d1ee9f589c34656fd31ef4ee2388a1b353c92408d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/connector/src/source/datagen/enumerator/mod.rs:42-52 | src/connector/src/source/nexmark/enumerator/mod.rs:41-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/datagen/enumerator/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de19bbb46f039740d02ad9dfabeceb700d8b3134eb17a4cc29c66f35bb0397e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/expr/mod.rs:741-750 | src/frontend/src/optimizer/rule/over_window_to_topn_rule.rs:214-223 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4440a0f9d5d1bd3f5f9a2c97f5fe5219fe0b7ebefe3a52afd107d18d28dff8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/optimizer/plan_node/batch_limit.rs:39-46 | src/frontend/src/optimizer/plan_node/batch_max_one_row.rs:40-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_limit.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dbdac35272657f4284b89f2aeb5b6697dfab370fa32df7861e7bbade5cb4eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/log_scan.rs:165-170 | src/frontend/src/optimizer/plan_node/generic/table_scan.rs:183-188 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/log_scan.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63c46369a615ac48698f52abd0bdf168fc4fa5f848efb8d8295712ea4689718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/project.rs:80-86 | src/frontend/src/optimizer/plan_node/generic/project_set.rs:53-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/generic/project.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d2c214142ff11a6c3079444c600786e3030987af2532e735f7fad3fb4ef555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/frontend/src/optimizer/plan_node/logical_agg.rs:986-995 | src/frontend/src/optimizer/plan_node/logical_over_window.rs:151-160 \u2014 before extracting anything, compare \u0060src/frontend/src/optimizer/plan_node/logical_agg.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/logical_over_window.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_agg.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c2afc90e24028ba8dd54ef9c0aa6f4fb6dbae7632efca5bbb82c888e356548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/frontend/src/optimizer/plan_node/logical_delete.rs:109-113 | src/frontend/src/optimizer/plan_node/logical_filter.rs:197-201 | src/frontend/src/optimizer/plan_node/logical_insert.rs:157-161 | src/frontend/src/optimizer/plan_node/logical_project_set.rs:357-361 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/frontend/src/optimizer/plan_node/logical_delete.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"003df4925eced0a6f433efaf6647b477701151677f701bc28cab9b0dfb2b0b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/telemetry.rs:91-103 | src/storage/compactor/src/telemetry.rs:92-104 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/telemetry.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7abba7d733419d61ad5c42cba894730d191615dbdbab7bd99266a811404c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/model/migration/src/m20251215_000000_streaming_job_parallelism_strategy.rs:8-21 | src/meta/model/migration/src/m20260312_000000_streaming_job_backfill_parallelism_strategy.rs:12-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/meta/model/migration/src/m20251215_000000_streaming_job_parallelism_strategy.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cfa5d18dfb770295b4442efb4c78f754c5d9bf01244d9359bb04c663a4b2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/service/src/ddl_service.rs:804-811 | src/meta/service/src/stream_service.rs:708-715 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/meta/service/src/ddl_service.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ba701ee57d39838a7d46d2bda040da5ff9e21b66d0ec1361a1b3602cca32ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/object_store/src/object/mem.rs:289-298 | src/object_store/src/object/sim/service.rs:54-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/object_store/src/object/mem.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdffe041e6020c70a8f851d27bc05b4c9146d787108466af334c9fa0b0f5b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/rpc_client/src/compactor_client.rs:59-67 | src/rpc_client/src/monitor_client.rs:61-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rpc_client/src/compactor_client.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c2400703410521536ffe00c458219e4d656c40710a47fe255cbe6c4d87446f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/stream/src/executor/asof_join.rs:313-320 | src/stream/src/executor/hash_join.rs:806-813 \u2014 before extracting anything, compare \u0060src/stream/src/executor/asof_join.rs\u0060 and \u0060src/stream/src/executor/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 244 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2316e1ef7e204fef9e30a190e2e3146e53c8d044c5016ac3ccf4ae8b4522680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/stream/src/executor/source/source_backfill_state_table.rs:107-113 | src/stream/src/executor/source/state_table_handler.rs:108-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":"src/stream/src/executor/source/source_backfill_state_table.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaa88b9c97ebfa2f4228f8fb56083cd516401042326cf21f066bbb69bc294ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/jni_core/src/lib.rs:706-739 | src/jni_core/src/lib.rs:811-831 | src/jni_core/src/lib.rs:934-960 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/jni_core/src/lib.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89d7c455595271261dc3ce5a1894703cd27f6828d540cb6338016ec8be801be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/meta/src/rpc/election/sql.rs:165-189 | src/meta/src/rpc/election/sql.rs:510-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":"src/meta/src/rpc/election/sql.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"34abd735bbd4e3d8618c3285fc3bdf4c94b72d19af638504a587d993b01846d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:590-610 | src/batch/executors/src/executor/order_by.rs:165-175 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/order_by.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"761035e9ce5fe44a61c1e265fd836a06083c3e3464ab1cad884863043860b1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:690-707 | src/batch/executors/src/executor/join/hash_join.rs:676-693 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/join/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"8864cb2cb8a0eb915ac1db4c96da00c4f3e6d519fb0c1ff9b7981ce487c3521f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs:171-188 | src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:291-304 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fb7ebff88e6af36dc54a20045c5eb0f0b9b7571e3a3c7c0b1effece48093ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/connector/src/sink/iceberg/writer.rs:1047-1061 | src/connector/src/sink/iceberg/writer.rs:1066-1082 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de18ac6c3a813e5831f80b8d54ab8d0f9f944d7a11de196396354655dfd3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/connector/src/sink/formatter/mod.rs:367-379 | src/connector/src/sink/formatter/mod.rs:396-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/formatter/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9956a9137dcb9a3887444f707d88d540a1f675c21e115fcc26e5ccefc6ec0024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/storage/src/hummock/compactor/shared_buffer_compact.rs:83-97 | src/storage/src/hummock/compactor/shared_buffer_compact.rs:98-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/shared_buffer_compact.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fec78f916898d76920c4b3910d9e441f87c3178056724dc2c5daa0f5b074381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/src/stream/stream_graph/fragment.rs:435-448 | src/meta/src/stream/stream_graph/fragment.rs:549-563 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ea7aae8bac6458429c310081d60ea33d5cc98956915a68ca3c202014339875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs:111-124 | src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs:135-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/model/migration/src/m20240820_081248_add_time_travel_per_table_epoch.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d501d00f6da518c23b954b8222d659a245763fa420341aaee99dc65410fd62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/risedevtool/src/task/compactor_service.rs:89-102 | src/risedevtool/src/task/compute_node_service.rs:111-124 | src/risedevtool/src/task/frontend_service.rs:102-115 | src/risedevtool/src/task/meta_node_service.rs:274-287 \u2014 before extracting anything, compare \u0060src/risedevtool/src/task/compactor_service.rs\u0060 and \u0060src/risedevtool/src/task/compute_node_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/task/compactor_service.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675c688d4682a188703237088fedd4688d165d982f3d3ea648abf0aac0c10b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/sqlparser/src/ast/mod.rs:2289-2302 | src/sqlparser/src/ast/mod.rs:2305-2318 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/ast/mod.rs"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea6886c6d7577bf8c32643a4aa12a8ff28a7e5777653a5c2afa2843b6bcf528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/connector/src/sink/iceberg/commit.rs:340-353 | src/connector/src/sink/iceberg/commit.rs:473-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/iceberg/commit.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7214095dce06c10dc714d4cf59553beecf1e01c3c83b24c1b3cd4856866eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/frontend/src/datafusion/execute/mod.rs:180-192 | src/frontend/src/scheduler/local.rs:178-191 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/frontend/src/datafusion/execute/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5b9a191481be10f53b0da86aaefc0efde8b97732390084c33dba5efd1955be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/storage/compactor/src/compactor_observer/observer_manager.rs:45-57 | src/storage/src/hummock/observer_manager.rs:58-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/compactor/src/compactor_observer/observer_manager.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feb1a651de50fec779b1abefb5273ef2035b16791e388fadef62032fb5d0356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/meta/src/rpc/election/sql.rs:202-214 | src/meta/src/rpc/election/sql.rs:377-389 | src/meta/src/rpc/election/sql.rs:552-564 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/meta/src/rpc/election/sql.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"de15a150d261fcce056c04cf8769271d53d300fad87e538dc6c7b8be7e42a5db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/expr/impl/src/scalar/jsonb_object.rs:59-71 | src/expr/impl/src/scalar/jsonb_object.rs:166-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":"src/expr/impl/src/scalar/jsonb_object.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92143beb7f4e7d8bb0d57c7ae298ae02fe7740a0dc1681140851137f5cb7a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/connector/src/sink/redis.rs:429-441 | src/connector/src/sink/redis.rs:459-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/redis.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"164161ed960ea43c64ee2b660699a54efa5db1c09c6b37a129e341cebc6b3267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/rpc_client/src/frontend_client.rs:47-59 | src/rpc_client/src/stream_client.rs:48-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rpc_client/src/frontend_client.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c795e300503938f1cb136ec787b017ddab8e2c5749b63f4ccbb99bccb6b975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/batch/executors/src/executor/hash_agg.rs:470-482 | src/batch/executors/src/executor/join/hash_join.rs:453-465 \u2014 before extracting anything, compare \u0060src/batch/executors/src/executor/hash_agg.rs\u0060 and \u0060src/batch/executors/src/executor/join/hash_join.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/batch/executors/src/executor/hash_agg.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad4f7fe7bbad9d35e83afaf79a27378d04f247d963a8ac965ab31233b6c8c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/connector/src/sink/iceberg/writer.rs:772-783 | src/connector/src/sink/iceberg/writer.rs:813-824 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"855f360ef3456e06440f38a59970a3d085ca439a46a06efb2b14762e45ec37e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): src/meta/src/manager/diagnose.rs:385-396 | src/meta/src/manager/diagnose.rs:399-410 | src/meta/src/manager/diagnose.rs:413-424 | src/meta/src/manager/diagnose.rs:427-438 | src/meta/src/manager/diagnose.rs:441-452 \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":"src/meta/src/manager/diagnose.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f264490d18a7584bba83ef2e25c645864746aacd06a05fc1c2f08987e2b0fc7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs:143-154 | src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:265-276 \u2014 before extracting anything, compare \u0060src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs\u0060 and \u0060src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_adbc_snowflake_fetch.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d14ee32928a4711ee91b6047220f470a1493efb509accb820b21000b58f04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/meta/src/controller/utils.rs:725-736 | src/meta/src/controller/utils.rs:773-784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/utils.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d43594d82e4a261eeb47cb1d7bc54bf589be7e150fcd5e4600a6b54cb1c7263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/optimizer/plan_node/generic/agg.rs:938-949 | src/frontend/src/optimizer/plan_node/generic/over_window.rs:98-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/generic/agg.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4ee48730c61d21e80cab975b46641af88805ddce03f7eb3cb3eb9580347e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/connector/src/parser/unified/debezium.rs:409-420 | src/connector/src/parser/unified/debezium.rs:451-459 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/parser/unified/debezium.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb0ee46946f32cb29329e43351450822505e05eefa611a9215787926bc41da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/connector/src/sink/iceberg/writer.rs:363-373 | src/connector/src/sink/iceberg/writer.rs:493-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":"src/connector/src/sink/iceberg/writer.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c29e54a5bb28b9022d737e820e4469d552f3ac2ca86646a17ed034fbae2ab3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/handler/create_source/validate.rs:284-291 | src/frontend/src/handler/create_source/validate.rs:297-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source/validate.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb1708c158b0d83d43351138324e65a307d58b514654a895bbfe07612345100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/stream/src/executor/asof_join.rs:746-757 | src/stream/src/executor/asof_join.rs:993-1004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/asof_join.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13987a7484c5ecbdd98b37abc68a54122cc46c0062a7b286a89316607c4c12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/stream/src/executor/match_recognize/executor.rs:191-201 | src/stream/src/executor/match_recognize/executor.rs:354-364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/match_recognize/executor.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"079376f03fa4f2a655ac8444357faca8d0d54548b350c5fad5d386fe9fda4cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/meta/src/manager/diagnose.rs:160-170 | src/meta/src/manager/diagnose.rs:209-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":"src/meta/src/manager/diagnose.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1652fdbb4a645b97c6b02aff0399af12b42f1c644dcbca9505ab2760a7656f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/connector/src/sink/redis.rs:390-400 | src/connector/src/sink/redis.rs:401-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/redis.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0b6191b5331cb0a1cbce381763302fd5094e967d7edf8ad44d21b7fcd8e3fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/common/src/util/stream_graph_visitor.rs:163-171 | src/common/src/util/stream_graph_visitor.rs:182-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/util/stream_graph_visitor.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e237876321cd1da2f40860b4d49d7acf90d7af2548ae611121b273b9d369d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/risedevtool/src/config_gen/grafana_gen.rs:51-61 | src/risedevtool/src/config_gen/grafana_gen.rs:85-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":"src/risedevtool/src/config_gen/grafana_gen.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0bf7660e6a00c693e0222469edf36a48f777bf65da003cf816dafc624386ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_iceberg_fetch.rs:291-301 | src/stream/src/executor/source/batch_source/batch_iceberg_list.rs:119-125 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/executor/source/batch_source/batch_iceberg_fetch.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"139e5674619503d11af4124358689cd9513a4d8e8bab828d01443c3c43d3453a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:219-226 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:200-210 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2362dfe4efe71faee4b6f5606ca2e861da8544993f199ee0e1bf1342aa0c7617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs:219-226 | src/stream/src/executor/source/batch_source/batch_opendal_fs_list.rs:200-210 | src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs:300-308 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_opendal_fs_fetch.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d19e04116522633e735305d1350fd0c32359dc80101170fc240fe2606a00dc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/frontend/src/expr/type_inference/func.rs:493-502 | src/frontend/src/expr/type_inference/func.rs:506-515 | src/frontend/src/expr/type_inference/func.rs:519-528 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7e77ecbce3ae177f0a52b1f31e45a3120fbc8528b93cb54f947888b391d3b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/meta/src/barrier/command.rs:257-266 | src/meta/src/barrier/command.rs:267-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/command.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a4e277f80b9e7fddd65ea3b7eb6d91817064af97abcbbf2157539a3e140fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:381-390 | src/meta/src/controller/catalog/alter_op.rs:413-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b87321eb825da11e6a3a1c4cd95652075a39c3de9e5ed7e34b04bccaae6871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/meta/src/controller/utils.rs:941-950 | src/meta/src/controller/utils.rs:960-966 | src/meta/src/controller/utils.rs:976-982 | src/meta/src/controller/utils.rs:1013-1019 | src/meta/src/controller/utils.rs:1029-1035 \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":"src/meta/src/controller/utils.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac98688cbca3b5b4d0083f4ce9f7eacc286b06da3e5c3c13a98b691436dc6161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/frontend/src/binder/expr/function/mod.rs:619-627 | src/frontend/src/binder/expr/function/mod.rs:692-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/function/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfd26f790c8c881b84e044615cd31d361aaa211c0e81d0609eaae736b539ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/sqlparser/src/parser.rs:3580-3588 | src/sqlparser/src/parser.rs:3796-3804 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/parser.rs"},"region":{"startLine":3580}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc737a689174c976c4c265bbc6947578f71fcb4c85f3e8d34ac97d20131f8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/stream/src/executor/source/reader_stream.rs:288-296 | src/stream/src/executor/source/reader_stream.rs:318-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":"src/stream/src/executor/source/reader_stream.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f739bba877095ebb9f7737e527f3b88f471b6f3616ade38a970d48c4ddd40ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/sqlparser/src/parser.rs:3664-3672 | src/sqlparser/src/parser.rs:3696-3703 \u2014 both copies are in the same file, so extract the block into one function there 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/sqlparser/src/parser.rs"},"region":{"startLine":3664}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d50497062158aae3bc53498103fed673b61baaf33de58175d92d52f73fc9e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/connector/src/sink/http.rs:464-472 | src/connector/src/sink/turbopuffer.rs:673-681 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/connector/src/sink/http.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffda5e597cd69e7eae0023e7c9d3b3df925b38d923b756d288c227ee3a2e3de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/binder/relation/gap_fill.rs:114-122 | src/frontend/src/binder/relation/gap_fill.rs:166-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/relation/gap_fill.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bbf90dbe35a2cbe64295ee85027d96b2e419b40763d11d474744a1b3cef3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 12): src/sqlparser/src/parser.rs:3388-3396 | src/sqlparser/src/parser.rs:3403-3411 | src/sqlparser/src/parser.rs:3554-3562 | src/sqlparser/src/parser.rs:3569-3577 | src/sqlparser/src/parser.rs:3584-3590 | src/sqlparser/src/parser.rs:3664-3672 | src/sqlparser/src/parser.rs:3696-3703 | src/sqlparser/src/parser.rs:3772-3779 | src/sqlparser/src/parser.rs:3786-3793 | src/sqlparser/src/parser.rs:3800-3806 | src/sqlparser/src/parser.rs:3929-3936 | src/sqlparser/src/parser.rs:3943-3950 \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":"src/sqlparser/src/parser.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c33e845b2ba3cfa2ad5e5c48d590b6694c17c99f2c338735c5087b8e7ebdf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/meta/src/controller/utils.rs:941-948 | src/meta/src/controller/utils.rs:960-964 | src/meta/src/controller/utils.rs:976-980 | src/meta/src/controller/utils.rs:992-1000 | src/meta/src/controller/utils.rs:1013-1017 | src/meta/src/controller/utils.rs:1029-1033 \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":"src/meta/src/controller/utils.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b045b7f23fd62bad48ddc280d94892dce8127aecef344db0abb327bf275be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/connector/src/sink/mqtt.rs:156-164 | src/connector/src/sink/nats.rs:102-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/mqtt.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eee32e47c658f89c4f73fbba1f443b7048be2fd24ea9df8aff2757340f03e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/common/proc_macro/src/session_config.rs:366-373 | src/common/proc_macro/src/session_config.rs:384-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/proc_macro/src/session_config.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"db510060d2d32055607963de57d56cdab4a8d03894683a82ba4b8f69c121138d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/frontend/src/optimizer/plan_node/stream_fs_fetch.rs:83-90 | src/frontend/src/optimizer/plan_node/stream_source_scan.rs:170-177 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/plan_node/stream_fs_fetch.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d3bb1f0075df5aa8fd524037047dd9fdfbf514cbd5c1e6f9eccc26b68f7026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/connector/src/parser/debezium/simd_json_parser.rs:72-79 | src/connector/src/parser/debezium/simd_json_parser.rs:119-126 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/parser/debezium/simd_json_parser.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b147077865110907c0517e2bea00dcbb1049bc1946badf724fdef30249d68844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/compactor/src/server.rs:216-223 | src/storage/compactor/src/server.rs:400-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/compactor/src/server.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc6384ed23f5530684d5d45e2e6794f996f3f4474ccac2489770ada519e2db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/storage/compactor/src/lib.rs:154-161 | src/storage/compactor/src/lib.rs:181-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":"src/storage/compactor/src/lib.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ada86019ff29ec49d3750320f8bb3b09f07cc94d8dd134fb39844772689de13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/src/manager/diagnose.rs:738-745 | src/meta/src/manager/diagnose.rs:747-754 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/manager/diagnose.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b17d54a2fb8b681e944d782ae2a92c414a08e0a2667eea25cf4acfbdbfb0b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/starrocks.rs:884-890 | src/connector/src/sink/starrocks.rs:908-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/starrocks.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cb2b0e90f01eb134520a7a6a4814acde67ff25069d5fb63879450dbf3d87a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/risedevtool/src/task/lakekeeper_service.rs:182-189 | src/risedevtool/src/task/lakekeeper_service.rs:304-311 \u2014 both copies are in the same file, so extract the block into one function there 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/risedevtool/src/task/lakekeeper_service.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b693388655b1e7c1a35d8ba33b1b788762a248f50aa044326590d8e800623734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/connector/src/sink/snowflake_redshift/redshift.rs:705-712 | src/connector/src/sink/snowflake_redshift/snowflake.rs:790-797 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/connector/src/sink/snowflake_redshift/redshift.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d16351e79f544a2783a42b67af771226dc287643f3784250e27505207bf14a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/expr/core/src/window_function/range.rs:348-355 | src/expr/core/src/window_function/session.rs:169-176 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/expr/core/src/window_function/range.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd2e0d25eb6a22786daae812f9b06e79aea81bdc93847089d5939d2987164ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/risedevtool/src/risedev_env.rs:167-173 | src/risedevtool/src/risedev_env.rs:185-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":"src/risedevtool/src/risedev_env.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dffbbe9ea6e468372775aa20c0f4d912714400be867bc5bb640dcedc28b751c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/risedevtool/src/task/frontend_service.rs:35-41 | src/risedevtool/src/task/meta_node_service.rs:85-91 \u2014 before extracting anything, compare \u0060src/risedevtool/src/task/frontend_service.rs\u0060 and \u0060src/risedevtool/src/task/meta_node_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/task/frontend_service.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c177bc0ec52e7fd7c92081472fc66c0dfc7a5afc95e470b8c3f12e79d876b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/frontend/src/optimizer/plan_node/utils.rs:664-670 | src/frontend/src/optimizer/plan_node/utils.rs:678-684 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/optimizer/plan_node/utils.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bf2d1f2035e969aff445faf0e8bbf5eeec9035ca683c526d3475e19d8625fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/expr/impl/src/scalar/vector.rs:222-228 | src/expr/impl/src/scalar/vector.rs:249-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":"src/expr/impl/src/scalar/vector.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d722cfad0df84a3a11ad7717ccee7aa37a60139df99b74415dad29043126b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/connector/src/sink/snowflake_redshift/snowflake.rs:1194-1200 | src/connector/src/sink/snowflake_redshift/snowflake.rs:1201-1207 \u2014 both copies are in the same file, so extract the block into one function there 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/connector/src/sink/snowflake_redshift/snowflake.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d35a4cd14ca61b754ddae3a861e47d864ab52eecef381ad47357866313b945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/connector/src/sink/starrocks.rs:585-591 | src/connector/src/sink/starrocks.rs:596-602 | src/connector/src/sink/starrocks.rs:608-614 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/connector/src/sink/starrocks.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c007ffa8f7907a5ed565701ec51710a0f9b1109f02aecb49b61faf6e4a199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/compute/src/rpc/service/monitor_service.rs:304-310 | src/compute/src/rpc/service/monitor_service.rs:323-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/rpc/service/monitor_service.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c78fb1f0e33cd38f15108496d6605306fef968ae10ae38022f9fda4ab997473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/meta/src/controller/catalog/alter_op.rs:72-77 | src/meta/src/controller/catalog/alter_op.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/controller/catalog/alter_op.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f5f0c2bd14a17064214aee3b7c44267ea5ef0f891b1f24543f9c30a7cc76bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/risedevtool/src/risedev_env.rs:219-224 | src/risedevtool/src/risedev_env.rs:251-256 \u2014 both copies are in the same file, so extract the block into one function there 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/risedevtool/src/risedev_env.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7e0a9403991676ce64d0e9c55ad4d5e62726dc4f9e3d3343e19ccc1134151d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/stream/src/executor/backfill/cdc/state_v2.rs:76-81 | src/stream/src/executor/backfill/cdc/state_v2.rs:83-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/cdc/state_v2.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"285bfe53c7fbc4b9c046de759b2064c7626f9cca62203d7f5bd3b64556168720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/risedevtool/src/risedev_env.rs:232-237 | src/risedevtool/src/risedev_env.rs:264-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/risedev_env.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef64a9afd8761297bfb31364ab6f373652323c71a57152fdc79824cae0e8cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): src/risedevtool/src/bin/risedev-dev.rs:187-192 | src/risedevtool/src/bin/risedev-dev.rs:207-212 | src/risedevtool/src/bin/risedev-dev.rs:216-221 | src/risedevtool/src/bin/risedev-dev.rs:252-257 | src/risedevtool/src/bin/risedev-dev.rs:378-383 | src/risedevtool/src/bin/risedev-dev.rs:386-391 | src/risedevtool/src/bin/risedev-dev.rs:404-408 \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":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfb824fa72dbf41c2510efd0ed7c62bd9989f457fa6b03d18aa3bfc266bf89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/meta/src/manager/diagnose.rs:918-923 | src/meta/src/manager/diagnose.rs:969-974 \u2014 both copies are in the same file, so extract the block into one function there 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/meta/src/manager/diagnose.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d63d911c7a8992342e8d8cf266ad20c6bd3817ca387d9f1d8c1b8535088c16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cmd_all/src/standalone.rs:110-114 | src/cmd_all/src/standalone.rs:117-121 | src/cmd_all/src/standalone.rs:124-128 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/cmd_all/src/standalone.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bdc509437dd457b8015228a0264c28d0655dc0ec4d8aac0374fb8120add430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/risedevtool/src/bin/risedev-dev.rs:196-200 | src/risedevtool/src/bin/risedev-dev.rs:394-398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bc0381d9d8261816dd2b5b92200af41e7e100d8a22532ff6f596c4fe05af3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/expr/type_inference/func.rs:793-797 | src/frontend/src/expr/type_inference/func.rs:801-805 \u2014 both copies are in the same file, so extract the block into one function there 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/frontend/src/expr/type_inference/func.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09a48f1cc8c45713901793b4a3e51fdbfe0f3d3e8c78ebeb6ab6e5fc97f57d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/common/src/bitmap.rs:505-509 | src/common/src/bitmap.rs:561-565 \u2014 both copies are in the same file, so extract the block into one function there 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/common/src/bitmap.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e32a537b3d7e98d202c783fe41e3c90e73a71d001f12bffd7cae46e8087e41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/frontend/src/optimizer/rule/table_function_to_internal_backfill_progress.rs:127-131 | src/frontend/src/optimizer/rule/table_function_to_internal_source_backfill_progress.rs:94-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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/frontend/src/optimizer/rule/table_function_to_internal_backfill_progress.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd91d02c5f46fe3b47d0057403b24990795b6613593a7a6b3d70e056e20886e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/storage/src/hummock/compactor/fast_compactor_runner.rs:96-100 | src/storage/src/hummock/compactor/iterator.rs:151-155 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/compactor/fast_compactor_runner.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ff757d576584802338081e6b4cd5a1ace6628bf2f3f0cf2ce423536dc4c42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/storage/src/hummock/iterator/skip_watermark.rs:230-235 | src/storage/src/hummock/iterator/skip_watermark.rs:422-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/iterator/skip_watermark.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19b33487f12a578a6535736c525b2ec60b14b9670be815464d2a7208ec5a9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/storage/src/monitor/local_metrics.rs:115-119 | src/storage/src/monitor/local_metrics.rs:161-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/monitor/local_metrics.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"759fff7821aa50047193b32f43eded4296f3b0237974b400ebacd1b625d477d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/stream/src/executor/source/source_backfill_executor.rs:797-801 | src/stream/src/executor/source/source_backfill_executor.rs:873-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":"src/stream/src/executor/source/source_backfill_executor.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39aac6d718608f059035678afbbd4d7253e73da7bd59c6d13a7675f9369c9d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java:91-120 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java:127-156 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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 \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java:91\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0ed480d54ecd36adff709337921584aec172d9a4a40c2e6c3bd31438e5e2b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java:116-145 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java:116-145 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5417b7a8de923a2bef8742f384fb0dc3fd372d27b75e91ab760fedee264f3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201330 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java:198-227 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java:362-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java: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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"05593f62cdfcb704f472f76b362c489d093fb3f871682d846a68cb3ffe5eda05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/PostgresConnection.java:238-260 | java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/PostgresConnection.java:285-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/PostgresConnection.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e364aca6ce20a6e7b478b7517547db53bf75a5d5f96bc4b2797c505cd832b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java:389-410 | java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java:578-599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java:389\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java:412\u0060 calls \u0060probeConnectionIfNeeded\u0060 and \u0060java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java:601\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":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"31191417954813717d1265cc5e4c47bd788837f1bcc8fffe4ef94640c5a996d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/ElasticBulkProcessorAdapter.java:43-62 | java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/OpensearchBulkProcessorAdapter.java:43-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 first that the copies are not typed on the same thing: \u0060BackoffPolicy\u0060 names \u0060org.elasticsearch.action.bulk.BackoffPolicy\u0060 in one and \u0060org.opensearch.action.bulk.BackoffPolicy\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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":"java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/ElasticBulkProcessorAdapter.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bceb8437316b3afc5073594975cf069a8148ff915047a614c480df2557b2c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java:88-104 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java:89-103 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec367e66b04120dc0f6c6385c79e357f2b26c329054b265106953b05df107ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java:354-369 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java:396-411 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"07debfd13469fee8765ad07385db8b094446a0f3f2fd729743982ea3a794e3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:313-328 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java:280-295 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java\u0060 and \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:313\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c906cd75cee58253d98de991250ffb2485e3458658af71d591c7d3af58d185c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java:72-85 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java:73-86 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc11d5573c57dda54cb06f21e017892f66b5f6818985c34e1b4de8488ae80fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkValidationHandler.java:45-58 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/SinkValidationHandler.java:52-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkValidationHandler.java:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkValidationHandler.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7589692b292fdd7811b447f65b9ad8e9f3b2a0ab0fe0516ed3eb3b48ded57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/ElasticRestHighLevelClientAdapter.java:45-56 | java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/OpensearchRestHighLevelClientAdapter.java:41-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the 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: \u0060RestClientBuilder\u0060 names \u0060org.elasticsearch.client.RestClientBuilder\u0060 in one and \u0060org.opensearch.client.RestClientBuilder\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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":"java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/ElasticRestHighLevelClientAdapter.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2335d0e09cb52e5ffa628ab12437dec1c7fa4cd3f7af88c817f7e881563d912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/BulkListener.java:44-54 | java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/BulkListener.java:76-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the 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 \u0060request\u0060 to \u0060org.elasticsearch.action.bulk.BulkRequest\u0060 in one and \u0060org.opensearch.action.bulk.BulkRequest\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":"java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/BulkListener.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fbb3e6913d721cd9e568f132ce243382bf1c844b818bc884885b3e8f4edea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzChangeEventConsumer.java:220-230 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzChangeEventConsumer.java:274-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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzChangeEventConsumer.java"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87ed17d30e5e58f4891547cf7272dbbb1d12f43b1a5f5f75e589ea590d56aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java:35-44 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java:38-47 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"66adf9dffec5dadf16631e84b8b304e15a6142481402815b5d41c380e2b644d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java:112-121 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java:123-132 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java:133-140 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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 \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java: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, \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java:108\u0060 calls \u0060validateBinlogConfig\u0060 and \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java:118\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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9489f67b3c6436c1a503258a9c20044be951f3e0ff2a7ded21f7929fd509db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:454-463 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:560-569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:454\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"629d481f09f683fd04bc7a84bb44684598eb3c7d08fd7bf0ad89abf36daad946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java:313-321 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:312-320 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java:279-287 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java\u0060 and \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java:313\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/MySqlValidator.java"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0068b43fbdde50864e509ee253c7ea47c8cbdb4918646407f83ae0ccbbda5082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:205-212 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java:143-151 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java\u0060 and \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java:205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/PostgresValidator.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33b2f42798eafccec6bef90be5b0b2c7b153906474f03c1ac10dd624d210767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzSourceHandler.java:68-76 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/JniDbzSourceHandler.java:139-147 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzSourceHandler.java:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzSourceHandler.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe772863221421637a5a5a055abb4f3083bf4eb3addcad4ddab314f31b5bccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java:88-95 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/PostgresDialect.java:118-125 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SnowflakeDialect.java:64-71 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java:124-131 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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 \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.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. The matched lines also transfer control out of the body holding them, 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":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2652267675c0978b1979c211efee30b65ced9a4c872320dac82808e9fca75bdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java:99-106 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/PostgresDialect.java:132-139 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java:135-142 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e46578633e8a8fa83d51fa95858d886b159929210fed2598a0fc018406ac926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java:117-124 | java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java:140-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java:117\u0060 it does not close everything it opens, so those exact 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, \u0060java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java:148\u0060 calls \u0060clear\u0060, \u0060add\u0060 and \u0060java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java:125\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":"java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"eced56fdd72fb4a9d5ac54db3ce813af92bf1b35ec123c37c3e46d41b372a825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraFactory.java:64-69 | java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java:67-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraFactory.java:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraSink.java:64\u0060 calls \u0060withConfigLoader\u0060 and \u0060java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraFactory.java:61\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":"java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraFactory.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b422e6956efcf1656096b085a0970dba75a17c727681e9d7c984eb50695c8442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkValidationHandler.java:37-42 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/SinkValidationHandler.java:41-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkValidationHandler.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b18813587f691b6c23cc51e9f25538e99b4959114de8c890c61d2a495c71a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java:147-151 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java:162-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/SqlServerValidator.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd9bfecb9b03e9bb5a58f4027bbc1f65ce70214a4f054784d909897a0aa0a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java:124-131 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java:160-167 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/SqlServerDialect.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/jdbc/MySqlDialect.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ad509218db7b33f5538cb584931cf2c03995d9ec03a01b22c434355beab0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java:279-287 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java:372-380 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9b90c01946d7714f1c4b50491af70754d65e21e002a7f0d1fc702cc86ec2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java:267-277 | java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java:360-370 \u2014 before extracting anything, compare \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java\u0060 and \u0060java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/JDBCSink.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-sink-jdbc/src/main/java/com/risingwave/connector/BatchAppendOnlyJDBCSink.java"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe742d9c408c530d7d596fca2b6ae74f9c97c0071d9711b4d47e56d50ff4ff7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): java/java-binding/src/main/java/com/risingwave/java/binding/HummockIterator.java:38-44 | java/java-binding/src/main/java/com/risingwave/java/binding/StreamChunkIterator.java:28-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, 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":"java/java-binding/src/main/java/com/risingwave/java/binding/HummockIterator.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03b18be9ec46c93e59ba522064ce42894418db66523b6de1c87e224c6127902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/FileSinkFactory.java:30-34 | java/connector-node/risingwave-sink-cassandra/src/main/java/com/risingwave/connector/CassandraFactory.java:39-43 | java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/EsSinkFactory.java:36-40 \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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/FileSinkFactory.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bc6e87b0360cadc43f1b2e25ecebb65d96794969699e5f9af5eb8a3226231d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkCoordinatorResponseObserver.java:39-44 | java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkWriterResponseObserver.java:38-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060response\u0060 to \u0060ConnectorServiceProto.SinkCoordinatorStreamResponse\u0060 in one and \u0060ConnectorServiceProto.SinkWriterStreamResponse\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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/JniSinkCoordinatorResponseObserver.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"480bad6e1e930f37bb89a994daa74f66ce2a3de37c0f90c9efdae94f99e4a990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): docs/metrics/extract.py:556-574 | docs/metrics/extract.py:591-609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7f895207d5ff7ff14aa8cb9119a8890920577b8fa6d2f7968ca109f6e5f00a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): docs/metrics/extract.py:402-415 | docs/metrics/extract.py:532-545 | docs/metrics/extract.py:619-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":"docs/metrics/extract.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d666a2fb9fe0b1ca3f64731385162075f5a484f0b60bcb508e08d6f7b81ecda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): docs/metrics/extract.py:60-73 | docs/metrics/extract.py:119-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff5dc704e2ed0758bc174d4f8a614e657f9e2099899f504242d1007db6d4ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): docs/metrics/extract.py:74-85 | docs/metrics/extract.py:134-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6168159d12736d94b62a2ce96f5b9674d2cdd96725574de5388b4fed85d253f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): grafana/dashboard/dev/streaming_fragments.py:61-72 | grafana/dashboard/dev/streaming_relations.py:86-96 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060grafana/dashboard/dev/streaming_fragments.py:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"grafana/dashboard/dev/streaming_fragments.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e07838879bb2e55101a197909cf14ecb67d0ccd0d6901109055e6cf98f88ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): docs/metrics/extract.py:553-563 | docs/metrics/extract.py:588-598 | docs/metrics/extract.py:635-645 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060docs/metrics/extract.py:646\u0060 calls \u0060extract_labels\u0060 and \u0060docs/metrics/extract.py:564\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39799561d3eb1907796d7a71ed8601d340e8741baa03b0b52f44fd1b2f6834a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): java/connector-node/python-client/pyspark-util.py:78-87 | java/connector-node/python-client/pyspark-util.py:107-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":"java/connector-node/python-client/pyspark-util.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54b479e78ad92ae47a53bc39e1df3ebbb6a0353343d2bccfbca2cff058a85a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): grafana/dashboard/common.py:94-102 | grafana/dashboard/common.py:105-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. 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":"grafana/dashboard/common.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"40158fa2b88a8488c4b310d163e4633fe8b683f187a6f9b0cfde73fd456d9e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): docs/metrics/extract.py:256-263 | docs/metrics/extract.py: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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/metrics/extract.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4fe0574a5c79acbb650fed48b185e41e2d86bc6d0f63d74b2c15629167bf45"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 66 shared lines): integration_tests/feature-store/server/src/model.rs:250-354 | integration_tests/feature-store/server/src/server_pb.rs:429-673 | integration_tests/feature-store/simulator/src/server_pb.rs:429-673 \u2014 These 3 members are variants of one another: a block of 66 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":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc948e86485bbbbc7311424dc3fe8864c020c71d2867595f4ee1948109ff90dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): e2e_test/subscription/main.py:449-480 | e2e_test/subscription/main.py:483-514 \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":"e2e_test/subscription/main.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace1be6809cea3031f77483c740fefa52e0f63cc85915793ef8c1b583565c483"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): integration_tests/feature-store/server/src/model.rs:112-127 | integration_tests/feature-store/server/src/model.rs:134-149 | integration_tests/feature-store/server/src/server_pb.rs:189-207 | integration_tests/feature-store/server/src/server_pb.rs:214-232 | integration_tests/feature-store/server/src/server_pb.rs:239-257 | integration_tests/feature-store/server/src/server_pb.rs:264-282 | integration_tests/feature-store/server/src/server_pb.rs:289-307 | integration_tests/feature-store/simulator/src/server_pb.rs:189-207 | integration_tests/feature-store/simulator/src/server_pb.rs:214-232 | integration_tests/feature-store/simulator/src/server_pb.rs:239-257 | integration_tests/feature-store/simulator/src/server_pb.rs:264-282 | integration_tests/feature-store/simulator/src/server_pb.rs:289-307 \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":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"101e5090e442a34a0ffd3f27258fd2ab4366cc7996238db35f68c7e7c5daf74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): e2e_test/s3/file_sink.py:59-156 | e2e_test/s3/file_sink.py:159-374 | e2e_test/s3/file_source.py:332-439 | e2e_test/s3/file_source.py:449-531 \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":"e2e_test/s3/file_sink.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"de486a6f25555acfd1126a315f7f64520670c3a1be4f8000b0dd8a976fe0f9a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): e2e_test/webhook/websocket_sender.py:404-465 | e2e_test/webhook/websocket_sender.py:481-510 | e2e_test/webhook/websocket_sender.py:514-543 | e2e_test/webhook/websocket_sender.py:547-574 \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":"e2e_test/webhook/websocket_sender.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6689081f34ab87009d5155b8a3d28f99ec24e354d0aaccacc3a0ead93947c902"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): integration_tests/iceberg-cdc/python/script/init.py:34-98 | integration_tests/iceberg-sink2/python/main.py:65-112 | integration_tests/iceberg-source/python/main.py:67-87 | integration_tests/iceberg-source/python/main.py:90-107 \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":"integration_tests/iceberg-cdc/python/script/init.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0a4c24d79783bf210f61fbf3714a65cfb7a7a6cdc3d26d44735ea19f5f9783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (225 lines \u00D7 2): integration_tests/feature-store/server/src/server_pb.rs:430-654 | integration_tests/feature-store/simulator/src/server_pb.rs:430-654 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 and \u0060integration_tests/feature-store/simulator/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 380 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/server_pb.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"336d39095c724005b35d86b23f73c17e8ab6168fcf8b539b4faf7045da21a640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): integration_tests/feature-store/server/src/model.rs:327-354 | integration_tests/feature-store/server/src/server_pb.rs:646-673 | integration_tests/feature-store/simulator/src/server_pb.rs:646-673 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/model.rs\u0060 and \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b18857e0daab8c7a198acb4d5df18a57f964633c3142cb8d16c0b5690695c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/stream/src/executor/test_utils/hash_join_executor.rs:169-184 | src/stream/src/executor/test_utils/hash_join_executor.rs:200-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":"src/stream/src/executor/test_utils/hash_join_executor.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12672064395dc3c29f46e0cf97533347d7adda738a07b565192eae0c7ed30e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 12): integration_tests/feature-store/server/src/model.rs:282-296 | integration_tests/feature-store/server/src/model.rs:326-340 | integration_tests/feature-store/server/src/server_pb.rs:461-475 | integration_tests/feature-store/server/src/server_pb.rs:507-521 | integration_tests/feature-store/server/src/server_pb.rs:553-567 | integration_tests/feature-store/server/src/server_pb.rs:599-613 | integration_tests/feature-store/server/src/server_pb.rs:645-659 | integration_tests/feature-store/simulator/src/server_pb.rs:461-475 | integration_tests/feature-store/simulator/src/server_pb.rs:507-521 | integration_tests/feature-store/simulator/src/server_pb.rs:553-567 | integration_tests/feature-store/simulator/src/server_pb.rs:599-613 | integration_tests/feature-store/simulator/src/server_pb.rs:645-659 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/model.rs\u0060 and \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff44ba4a0820e3b091f655699e7a1aed80173cec766a4369bb66a40dfcccfa61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): integration_tests/feature-store/server/src/server_pb.rs:194-207 | integration_tests/feature-store/simulator/src/server_pb.rs:194-207 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 and \u0060integration_tests/feature-store/simulator/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 380 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/server_pb.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7a463bcc162c8582b2563c03aba111a4b9c4f0bd81dce8af892eca8dbe373c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): integration_tests/feature-store/server/src/server_pb.rs:219-232 | integration_tests/feature-store/simulator/src/server_pb.rs:219-232 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 and \u0060integration_tests/feature-store/simulator/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 380 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/server_pb.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"824b927cb15892bb3f9f078141c15b854127f114b197a434aa05d5e622b1eb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): integration_tests/feature-store/server/src/server_pb.rs:244-257 | integration_tests/feature-store/simulator/src/server_pb.rs:244-257 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 and \u0060integration_tests/feature-store/simulator/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 380 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/server_pb.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"01215726f89bf0f4fa92899282aab7da10c5d32c5f899bb32a5f06414cad8989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): integration_tests/feature-store/server/src/server_pb.rs:269-282 | integration_tests/feature-store/simulator/src/server_pb.rs:269-282 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 and \u0060integration_tests/feature-store/simulator/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 380 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/server_pb.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"839a7cc4ec7f1772e41aafa21d20ddea49e3ebc6e1e2eec579732336fe4a2671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): integration_tests/feature-store/server/src/server_pb.rs:294-307 | integration_tests/feature-store/simulator/src/server_pb.rs:294-307 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 and \u0060integration_tests/feature-store/simulator/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 380 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/server_pb.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4999d1c23749f088a2854d96796f20fa0bb14016718698187c325d56fdecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/frontend/src/test_utils.rs:198-209 | src/frontend/src/test_utils.rs:246-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/test_utils.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc43f0a03c9ca66d96b3fab9b1e5df605bb16a0670cadb38b1267f0720f8e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 12): integration_tests/feature-store/server/src/model.rs:113-122 | integration_tests/feature-store/server/src/model.rs:135-144 | integration_tests/feature-store/server/src/server_pb.rs:190-200 | integration_tests/feature-store/server/src/server_pb.rs:215-225 | integration_tests/feature-store/server/src/server_pb.rs:240-250 | integration_tests/feature-store/server/src/server_pb.rs:265-275 | integration_tests/feature-store/server/src/server_pb.rs:290-300 | integration_tests/feature-store/simulator/src/server_pb.rs:190-200 | integration_tests/feature-store/simulator/src/server_pb.rs:215-225 | integration_tests/feature-store/simulator/src/server_pb.rs:240-250 | integration_tests/feature-store/simulator/src/server_pb.rs:265-275 | integration_tests/feature-store/simulator/src/server_pb.rs:290-300 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/model.rs\u0060 and \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eef99aefad2713cd7106041c02a3c19c9949dcb6ebe09ad97e0a36d5d5b70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 12): integration_tests/feature-store/server/src/model.rs:270-280 | integration_tests/feature-store/server/src/model.rs:314-324 | integration_tests/feature-store/server/src/server_pb.rs:449-459 | integration_tests/feature-store/server/src/server_pb.rs:495-505 | integration_tests/feature-store/server/src/server_pb.rs:541-551 | integration_tests/feature-store/server/src/server_pb.rs:587-597 | integration_tests/feature-store/server/src/server_pb.rs:633-643 | integration_tests/feature-store/simulator/src/server_pb.rs:449-459 | integration_tests/feature-store/simulator/src/server_pb.rs:495-505 | integration_tests/feature-store/simulator/src/server_pb.rs:541-551 | integration_tests/feature-store/simulator/src/server_pb.rs:587-597 | integration_tests/feature-store/simulator/src/server_pb.rs:633-643 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/model.rs\u0060 and \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9279d02ed2bee85a2f62f1733fcdc0947d565c744d5db8f577c3080a4fb632b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/frontend/src/test_utils.rs:506-516 | src/frontend/src/test_utils.rs:537-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":"src/frontend/src/test_utils.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd5b69599e78e2b1dd704df026397bff52534ae54a4398bcaa99d16801798ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/meta/src/hummock/test_utils.rs:165-172 | src/meta/src/hummock/test_utils.rs:201-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":"src/meta/src/hummock/test_utils.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e59cdef54fc229963fd40b597df479dad5854de8626c8674c601dcb5e801cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): integration_tests/feature-store/server/src/model.rs:187-196 | integration_tests/feature-store/server/src/server_pb.rs:366-375 | integration_tests/feature-store/simulator/src/server_pb.rs:366-375 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/model.rs\u0060 and \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed62255de6fedaa8daff7479302fbf54f2cb3caaf98bff46e46dea242cf6fe1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): integration_tests/feature-store/server/src/model.rs:357-366 | integration_tests/feature-store/server/src/server_pb.rs:676-685 | integration_tests/feature-store/simulator/src/server_pb.rs:676-685 \u2014 before extracting anything, compare \u0060integration_tests/feature-store/server/src/model.rs\u0060 and \u0060integration_tests/feature-store/server/src/server_pb.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/feature-store/server/src/model.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d89f6622b9f5d94e67fae68dcb804067f43c15ffbf161e4b66dd2da336c680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): e2e_test/udf/remote_java/src/main/java/com/example/UdfExample.java:235-252 | e2e_test/udf/remote_java/src/main/java/com/example/UdfExample.java:299-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/udf/remote_java/src/main/java/com/example/UdfExample.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"905aff84499b4bdef7ea7ec2e4bd7d2549896d10ffaee2ba2c2e20f2ab057640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): java/java-binding-integration-test/src/main/java/com/risingwave/java/binding/HummockReadDemo.java:87-97 | java/java-binding-integration-test/src/main/java/com/risingwave/java/binding/StreamChunkDemo.java:32-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060java/java-binding-integration-test/src/main/java/com/risingwave/java/binding/HummockReadDemo.java:87\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/java-binding-integration-test/src/main/java/com/risingwave/java/binding/HummockReadDemo.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"036ef15df5454dbaebcfe09b8daacea1085950d3bdbcabe98d703ffde3a2bd59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (90 lines \u00D7 2): e2e_test/s3/file_sink.py:173-262 | e2e_test/s3/file_sink.py:266-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060e2e_test/s3/file_sink.py:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/s3/file_sink.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e12af75ffde356017b274d6ae30b39b8b642ded8a600947a3bd97e1f62a9075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201342 lines \u00D7 2): e2e_test/s3/file_source.py:70-111 | e2e_test/s3/file_source.py:249-286 \u2014 both copies are in the same file, so extract the block 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":"e2e_test/s3/file_source.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7f38e4075c6d3b5316267ec8f9d38e1788db1f9ab9afa368c23ed70cdebbcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201340 lines \u00D7 3): e2e_test/s3/file_source.py:59-94 | e2e_test/s3/file_source.py:160-199 | e2e_test/s3/file_source.py:239-272 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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 \u0060e2e_test/s3/file_source.py:239\u0060 it begins part-way through the construct above it, so those exact 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":"e2e_test/s3/file_source.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"543595292626e1796aa07e730bd9eaeb42b96fbf12de84aacdf6bafb7f7ab890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201330 lines \u00D7 4): e2e_test/webhook/websocket_sender.py:456-465 | e2e_test/webhook/websocket_sender.py:481-510 | e2e_test/webhook/websocket_sender.py:514-543 | e2e_test/webhook/websocket_sender.py:547-574 \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 \u0060e2e_test/webhook/websocket_sender.py:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/webhook/websocket_sender.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b9d5663e86524aa1084681b097251faffa1ba098490bcef6720952795a9ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): e2e_test/s3/file_source.py:20-37 | e2e_test/s3/file_source.py:124-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":"e2e_test/s3/file_source.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"14facb4fe9ccf6d768cd97afac567722337a370cde85a12c3d34e224334f34cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201322 lines \u00D7 3): integration_tests/iceberg-sink2/python/main.py:39-60 | integration_tests/iceberg-sink2/python/main.py:116-126 | integration_tests/iceberg-source/python/main.py:41-62 \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":"integration_tests/iceberg-sink2/python/main.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86733928140d5a8f17aa2a307666bb5fd2e8769a3771b69352ba29be47b6797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): e2e_test/subscription/main.py:124-145 | e2e_test/subscription/main.py:149-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"769dbddb1f8df6f209798398462668a00e6c814605434323a8fd26f97ed2571f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): e2e_test/s3/file_sink.py:130-148 | e2e_test/s3/file_source.py:395-413 | e2e_test/s3/file_source.py:502-520 \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":"e2e_test/s3/file_sink.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38b07317cf79e584488427078b7603bdc2a4b063bf8975e0b2fdec9beed0ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): e2e_test/s3/file_source.py:332-349 | e2e_test/s3/file_source.py:449-466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/s3/file_source.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d35167380244a0978fe43bef64a726a7ad06be4f8b22268f22d8b4797c6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): e2e_test/subscription/main.py:72-87 | e2e_test/subscription/main.py:228-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060e2e_test/subscription/main.py:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ea2465da9092ef5a857701b985891e42c31586a2144ab7eb5ed354713059d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): e2e_test/subscription/main.py:48-62 | e2e_test/subscription/main.py:67-81 | e2e_test/subscription/main.py:223-238 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"e2e_test/subscription/main.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"522beba82658f606bf7d2b92de4a726b7db853c1ab94b5bcf2213f10a2d92b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): e2e_test/check_slt_coverage.py:566-579 | e2e_test/check_slt_coverage.py:581-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 \u0060e2e_test/check_slt_coverage.py:566\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/check_slt_coverage.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"65be06096f40682403118f355430cb6bd11bfc96a34f6b5f6f71e7d918b5376b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): e2e_test/subscription/main.py:449-464 | e2e_test/subscription/main.py:483-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ddbc2115889b4762ab6e27bc350ed8c1b2024da2b6ecd2132cbd9e2ec47308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): e2e_test/subscription/main.py:96-110 | e2e_test/subscription/main.py:174-188 | e2e_test/subscription/main.py:296-310 | e2e_test/subscription/main.py:548-561 \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":"e2e_test/subscription/main.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c97e84dcf60ce463f1ec141f6cee59e81796ccab90e0e1d3218e4d11a63f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): integration_tests/scripts/compatibility/cli.py:37-51 | integration_tests/scripts/compatibility/cli.py:60-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":"integration_tests/scripts/compatibility/cli.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e4585d37eeac4fd5aceccee1fb4272c1cfb37e9caa0f3f226cb21d9cc12ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 8): e2e_test/subscription/main.py:95-108 | e2e_test/subscription/main.py:123-136 | e2e_test/subscription/main.py:148-161 | e2e_test/subscription/main.py:173-186 | e2e_test/subscription/main.py:295-308 | e2e_test/subscription/main.py:338-351 | e2e_test/subscription/main.py:360-372 | e2e_test/subscription/main.py:547-559 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060e2e_test/subscription/main.py:137\u0060 calls \u0060sleep\u0060 and \u0060e2e_test/subscription/main.py:109\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":"e2e_test/subscription/main.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3678526d3568a676500ca25de88452605daaa809ca7dfda7b4868ec06ec43f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): e2e_test/subscription/main.py:81-91 | e2e_test/subscription/main.py:107-119 | e2e_test/subscription/main.py:238-251 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"e2e_test/subscription/main.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f082d7e02f51ddad06128611f3b1233087e44da808914bcc75003f4289b44798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): e2e_test/subscription/main.py:405-417 | e2e_test/subscription/main.py:517-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34570cb0f0b3f3286a474f0ad65e4f0b535729f303bdcdbf04888bb98159c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): e2e_test/s3/file_sink.py:141-151 | e2e_test/s3/file_sink.py:355-365 | e2e_test/s3/file_source.py:406-416 | e2e_test/s3/file_source.py:513-523 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/s3/file_sink.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf59b2d886e8c68cde9c50b54c662aebc26bd20ccb7d3b4519279b6c97d7821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): e2e_test/subscription/main.py:316-323 | e2e_test/subscription/main.py:345-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060e2e_test/subscription/main.py:345\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adf37a55d1a689e3f4426f49a533baac9825fe2ef88e4fa261c7f503f05b0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): e2e_test/s3/file_sink.py:439-453 | e2e_test/s3/file_sink.py:468-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/s3/file_sink.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782195f68aeafada4f66fb121dfb591b65368ce21009043b7503edd35739160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): e2e_test/subscription/main.py:313-321 | e2e_test/subscription/main.py:556-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba7bdd07307b1dfdedb4049bf9265b7ea33d271832742d413df352a82e9969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): e2e_test/subscription/main.py:420-428 | e2e_test/subscription/main.py:429-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafc11e92f7407a1d585615446309b9bced2165849d7b6bc56cf52d69e7d8e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): integration_tests/scripts/compatibility/cli.py:14-22 | integration_tests/scripts/compatibility/cli.py:59-67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/scripts/compatibility/cli.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3a9eca746fa928d14e4b73846e3e9731c37987b8803dddcd054dedc2dab961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): integration_tests/scripts/compatibility/compatibility.py:192-200 | integration_tests/scripts/compatibility/compatibility.py:209-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/scripts/compatibility/compatibility.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"882582d35663beda0698c132d213d6857a4d4d789c911a7b3983dca3f5a10f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): e2e_test/subscription/main.py:318-324 | e2e_test/subscription/main.py:349-355 | e2e_test/subscription/main.py:412-419 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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 \u0060e2e_test/subscription/main.py:412\u0060 it begins part-way through the construct above it, so those exact 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, \u0060e2e_test/subscription/main.py:347\u0060 calls \u0060execute_insert\u0060 and \u0060e2e_test/subscription/main.py:412\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":"e2e_test/subscription/main.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e78f7935487d72c1a2b9eeccfbf50ccacac371e9729d622c162a1a17001090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): e2e_test/subscription/main.py:458-464 | e2e_test/subscription/main.py:469-475 | e2e_test/subscription/main.py:492-498 | e2e_test/subscription/main.py:503-509 \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":"e2e_test/subscription/main.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb85375238804af3f46f931fe89a047f81a12fac246e3f57521fc07dc5ef3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): integration_tests/iceberg-cdc/python/script/init.py:92-98 | integration_tests/iceberg-sink2/python/main.py:107-112 | integration_tests/iceberg-source/python/main.py:82-87 | integration_tests/iceberg-source/python/main.py:99-105 \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 \u0060integration_tests/iceberg-cdc/python/script/init.py: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060integration_tests/iceberg-sink2/python/main.py:107\u0060 calls \u0060connect\u0060 and \u0060integration_tests/iceberg-cdc/python/script/init.py:92\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":"integration_tests/iceberg-cdc/python/script/init.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"572fcfee146841d9f163dc681cf8b12a7e96e6ba7ea093c960356bc456079572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): e2e_test/commands/psql_refill_validate.py:160-166 | e2e_test/commands/psql_refill_validate.py:179-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/commands/psql_refill_validate.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1dd5d9a968261ff6cf8e27313fb3d59f787a4473edf9d4815d902d9a6b48a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): e2e_test/source_inline/kafka/protobuf/pb.py:20-26 | e2e_test/source_inline/kafka/protobuf/pb.py:31-37 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060e2e_test/source_inline/kafka/protobuf/pb.py:20\u0060 it does not close everything it opens, so those exact 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":"e2e_test/source_inline/kafka/protobuf/pb.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"992ed1c13739db78863a814fc2276699ec29d30b92153f5166f9da9928cdc39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): e2e_test/subscription/main.py:319-324 | e2e_test/subscription/main.py:350-355 | e2e_test/subscription/main.py:414-419 | e2e_test/subscription/main.py:423-428 | e2e_test/subscription/main.py:432-437 \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, \u0060e2e_test/subscription/main.py:347\u0060 calls \u0060execute_insert\u0060 and \u0060e2e_test/subscription/main.py:412\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":"e2e_test/subscription/main.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"83777e3a8aaf4c7c32dbfe15d483c5c5c50e2337831390da084902851784c6df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): e2e_test/subscription/main.py:526-531 | e2e_test/subscription/main.py:535-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"81210afd2ffb6615929dca936d93ce19ba4562285abbf13ec7d0c1c649428816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): integration_tests/scripts/clean_demos.py:11-17 | integration_tests/scripts/run_demos.py: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. 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":"integration_tests/scripts/clean_demos.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1654cf042ae2ba2f09d333f766a6d815fecad7df36029466b9775721748d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): e2e_test/subscription/main.py:321-325 | e2e_test/subscription/main.py:329-333 | e2e_test/subscription/main.py:352-356 | e2e_test/subscription/main.py:416-420 | e2e_test/subscription/main.py:425-429 | e2e_test/subscription/main.py:434-438 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060e2e_test/subscription/main.py:423\u0060 calls \u0060execute_insert\u0060 and \u0060e2e_test/subscription/main.py:328\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":"e2e_test/subscription/main.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0da10ae2815c0fb03d6dd0bb773059cf767311c22ceadd0bf74a7265a6e4c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): e2e_test/subscription/main.py:476-480 | e2e_test/subscription/main.py: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/subscription/main.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e144d284d953a1061a59da79cd28d54b50474da278278ce8c5b41c42f17b4f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): e2e_test/source_legacy/basic/scripts/schema_registry_producer.py:14-18 | integration_tests/upsert-avro/datagen.py:20-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"e2e_test/source_legacy/basic/scripts/schema_registry_producer.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80cff1e054da1aa1b59e7548689905f0727d1923dbcb7c759db1588d60166ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): e2e_test/webhook/expect_failure.py:20-25 | e2e_test/webhook/websocket_sender.py:238-243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/webhook/expect_failure.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9a385d632c9f84eef0ae5a0c4bfcfc9a3a17b23d0bda8a28ae5320cb072fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): integration_tests/client-library/python/crud.py:12-25 | integration_tests/client-library/python/crud.py:67-76 | integration_tests/client-library/python/materializeview.py:34-41 \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":"integration_tests/client-library/python/crud.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"31153b190923305bd8c9cc378b87fabe975c46286f9ca6e95406b9f02acfc3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): e2e_test/source_inline/cdc/mysql/cron_only/extract_direct_cdc_current_offset.py:40-44 | e2e_test/source_inline/cdc/mysql/cron_only/inject_source_offsets_with_retry.py:11-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/source_inline/cdc/mysql/cron_only/extract_direct_cdc_current_offset.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3024a1d2d2fe0293b95c5d98cf82c7e0257a33b16ffe088ac34c79b773bcb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): integration_tests/datagen/compatible_data/compatible_data.go:131-143 | integration_tests/datagen/compatible_data/compatible_data.go:166-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":"integration_tests/datagen/compatible_data/compatible_data.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e07ff56cd70df283caeb72f9cb3e8acfb5f9349356402c4c9788b4f6e9789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): integration_tests/datagen/sink/mysql/mysql.go:43-51 | integration_tests/datagen/sink/postgres/postgres.go:40-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/datagen/sink/mysql/mysql.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c4ff5a1996506a079b2c6ee0fdaaaaa01eb82a6bcca50a64f5bfb8e225b629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): integration_tests/datagen/cdn_metrics/nics.go:59-65 | integration_tests/datagen/cdn_metrics/tcp.go:48-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"integration_tests/datagen/cdn_metrics/nics.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"424454f8035cd789f835c365ffbaa6bec89f844b407744d0ccf44999b11c1f7b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project risingwave_cmd: risingwave_cmd has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"07e08d746c66cc27bfebf09b9a1d3dcbf53ad2b6dca704cf268ad4e674133dfa"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project risingwave_compute: risingwave_compute has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"10837daef4dfa3c3d40c6fcccdf421d70cca422715af18ed8e8442614cfd8da6"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project risingwave_ctl: risingwave_ctl has instability 0.86 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aa6fb5f6ca19d7861634e2636fbd8c4bd9747f0334766f9fce9f80fde6b9abda"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project risingwave_frontend: risingwave_frontend has instability 0.86 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9369caeac824bf90aa5ab20732d304c539085b355181d3620f3737e232067def"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project risingwave_meta: risingwave_meta has instability 0.84 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5e094695b702e43020037eee6b4bcffd39635d91ebbad6fa9b1837ecf826eaec"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project risingwave_meta_service: risingwave_meta_service has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7c361bb043b083b8fa268148fd631eac24dff3555f1b441ada97a647e940fa88"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project risingwave_stream: risingwave_stream has instability 0.87 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ee8d1e3444d5d7f0024433fbaa417d10502823ee2755c9ed1d996ff36e529683"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: delta_btree_map: delta_btree_map: 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":"d92563aa82567f09f8e16173d09b2874c54b4c4208de265d10424f4679dd9758"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: risingwave_common_log: risingwave_common_log: abstractness 0.00, instability 0.00, distance 1.00 \u2014 the shape a shared-kernel / building-block library has BY DESIGN \u2014 concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bcfcfd455f881321c0afa7ab44f27b2173df6e7f4baa1a91564f8ba07ee33794"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: risingwave_error: risingwave_error: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"171b95ba51e88370ce219828da2bae974322974b25499ce3c241407b314a77bc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: risingwave_meta_dashboard: risingwave_meta_dashboard: 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":"3a335e0e0437bbe5f702927f61b1252da58a5d0f1c12d4945ac71ff18939636b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: sync-point: sync-point: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1075d127a0c71d772625e4338950b8622f9d7cb249036195fad10c163eaedcea"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: risingwave_sqlparser: risingwave_sqlparser: abstractness 0.05, instability 0.14, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f42f3d05c3b5e69c44f31ebc40b27cd10f099a86fe5a64496d31350a0b69a4ff"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: risingwave_object_store: risingwave_object_store: abstractness 0.07, instability 0.13, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6108d8b548693079358a1f13adb901c9349b6d643cf5db55f3d80a7bb5f8a197"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: common-utils: common-utils: abstractness 0.00, instability 0.25, distance 0.75 \u2014 the shape a shared-kernel / building-block library has BY DESIGN \u2014 concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"34cc9d73136c94f40b7b34c85065cc74a7eeff1d9edb35791fa425e3f0d492a5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: risingwave_dml: risingwave_dml: abstractness 0.00, instability 0.29, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ef6889ee7d7727e3ee0bde4b5960f76ee032b000e5ddb16f02f82a919db8d24"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 .NET and JavaScript/TypeScript suite: Coverage NOT MEASURED: the .NET half could not be measured \u2014 no coverage produced (collector absent, or test run exceeded the inline budget); the JavaScript/TypeScript half could not be measured \u2014 the jest suite in src/utils/pgwire/tests/js/ ran and not one test passed (FAIL test/pgwire.test.ts), so the coverage would describe the failed run, not the code. This repository\u0027s production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: CreateAndReadFromTable: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/csharp/NpgsqlTest.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f25e6d20e01b41c320cdf7ecf2be24c4998e70dd87b3f93713a43d28439aad"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated module: github.com/aws/aws-sdk-go: \u0060github.com/aws/aws-sdk-go\u0060 is required at v1.44.126 in integration_tests/datagen/go.mod, and its author has DEPRECATED the module: \u0022aws-sdk-go is deprecated. Use aws-sdk-go-v2. See https://aws.amazon.com/blogs/developer/announcing-end-of-support-for-aws-sdk-for-go-v1-on-july-31-2025/.\u0022 A deprecation is declared by the author in the module\u0027s own go.mod and applies to the whole module, not to one release, so moving to a newer version of it does not clear this. Follow the replacement the notice names."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2375c93ffe81bb372212a8aa94dcf572bc83bc9a71eb632225a0f31a18fe18c3"}},{"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":"d668d9e2a8bf8fe03b3c651f911b31537b26af83e4a9c0c6042486a79eed27c4"},"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"}}]},{"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":"b5ecf09d691dc1405fbe5154eae7f1f7465629fc2ca0b88b6d57aa65224e66f8"},"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"}}]},{"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":"a1daccc62bf25eaed7581f2769952bb2c3836a3572d70fddd7b1c9b3f1e7158c"},"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"}}]},{"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":"052ef5ce85d9e11cdae70a18b49b555b5f0c37538fe8fcb1740e9cb612f25841"},"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"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/barrier/checkpoint/state.rs: src/meta/src/barrier/checkpoint/state.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in DatabaseCheckpointControl::apply_command at line 432. 6 of those changes were fix/bug commits, and the other 9 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/checkpoint/state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/state.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83f27bafdb49b639917b645446569e61c969478b6445bff0e2a811deef433dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/sqlparser/src/ast/mod.rs: src/sqlparser/src/ast/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 148 in Statement::fmt_unchecked at line 1801. 1 of those changes was a fix/bug commit, and the other 6 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/sqlparser/src/ast/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":"src/sqlparser/src/ast/mod.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfde6b32d85a26664bde58c2761d2dcfd79c8b93a60fba5aa2c9ff48ea9e3ab3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/handler/mod.rs: src/frontend/src/handler/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 181 in risingwave_frontend::handler::handle at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/handler/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":"src/frontend/src/handler/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad8d36f51e3ff751e147252b08e7e430f2ec358105c2025e871fb159745c20a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/barrier/worker.rs: src/meta/src/barrier/worker.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in GlobalBarrierWorker::run_inner at line 516. 9 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/worker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/worker.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"152e889db6ec405de3db3cb88f19c2b05cf7e210020c48aeead06ed1ed1042b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/backfill/cdc/cdc_backfill.rs: src/stream/src/executor/backfill/cdc/cdc_backfill.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in CdcBackfillExecutor::execute_inner at line 329. 4 of those changes were fix/bug commits, and the other 4 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/backfill/cdc/cdc_backfill.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/stream/src/executor/backfill/cdc/cdc_backfill.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d0c5b9362fb976921a0fe9591f2fbe83cf7b9a3de75e6d2a4a23c32e482b4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/controller/streaming_job.rs: src/meta/src/controller/streaming_job.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in CatalogController::create_job_catalog at line 467. 9 of those changes were fix/bug commits, and the other 10 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/controller/streaming_job.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/controller/streaming_job.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf770b1effc64b329f51ff1aa8635776bf033506d720f32423c4f116155c9f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/connector_common/iceberg/mod.rs: src/connector/src/connector_common/iceberg/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in IcebergCommon::build_jni_catalog_configs at line 766. 2 of those changes were fix/bug commits, and the other 4 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/connector_common/iceberg/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":"src/connector/src/connector_common/iceberg/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"9899f4050cabe2dd4db188f2e16e41ffdfec5cf3378e15ac3ddcdc242a71d7f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/rpc/ddl_controller.rs: src/meta/src/rpc/ddl_controller.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in DdlController::run_command at line 444. 5 of those changes were fix/bug commits, and the other 7 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/rpc/ddl_controller.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/rpc/ddl_controller.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a8c80ff6396f3dee79896cec1ebfab57fb3f81b07075969255d463559f5b6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs: src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in ParallelizedCdcBackfillExecutor::execute_inner at line 114. 1 of those changes was a fix/bug commit, and the other 3 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/backfill/cdc/cdc_backill_v2.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/stream/src/executor/backfill/cdc/cdc_backill_v2.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bffcd68816aeb581b37afb612898cba68f846d92b9176094ac0b8066c11a0df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/src/hummock/compactor/mod.rs: src/storage/src/hummock/compactor/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in risingwave_storage::hummock::compactor::start_iceberg_compactor at line 400. 2 of those changes were fix/bug commits, and the other 7 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/src/hummock/compactor/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":"src/storage/src/hummock/compactor/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c82f660a00d0e9caa66657293ff4023b78202cb5d5c1bdcd32c334444f0006"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/handler/create_sink.rs: src/frontend/src/handler/create_sink.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in risingwave_frontend::handler::create_sink::gen_sink_plan 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/handler/create_sink.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/frontend/src/handler/create_sink.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c70507216884c279398a8c6c0c9b4a8c7341ac2e7a4e633dde9f0ec85c9b1b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/barrier/checkpoint/control.rs: src/meta/src/barrier/checkpoint/control.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CheckpointControl::handle_new_barrier at line 236. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/checkpoint/control.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63a7386d908fb863a232981bcd781770d991aa5f90352cd1176e6518b70d953"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/common/src/array/arrow/arrow_impl.rs: src/common/src/array/arrow/arrow_impl.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in FromArrow::from_array at line 648. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/array/arrow/arrow_impl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/common/src/array/arrow/arrow_impl.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"da77e1e7e459e544da35c88b537228f0b593ff130c3c0284ae31e8356f55ab8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/barrier/rpc.rs: src/meta/src/barrier/rpc.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PartialGraphRecoverer::inject_database_initial_barrier at line 619. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/rpc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/rpc.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f55e4a0214b0106cb8b501c7a404c0ed4111583660b869580561ba340872b14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ctl/src/lib.rs: src/ctl/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in risingwave_ctl::start_impl at line 666. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/ctl/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/ctl/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0417d2e1b396bc96c73bfe243182035e73ac2fadb9ac38f597cac66f083fe0e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/barrier/context/context_impl.rs: src/meta/src/barrier/context/context_impl.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in PostCollectCommand::post_collect at line 634. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/context/context_impl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/context/context_impl.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d3866f6a268f9a0882208e9581776a128401bfd274c21a4bb1ea03a19b8ee7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/parser/unified/json.rs: src/connector/src/parser/unified/json.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in JsonParseOptions::parse at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/parser/unified/json.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/connector/src/parser/unified/json.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ac3bffaeb8ee713ddec76f3b3bbbe7459c1d0ce1320d0e10d0d7d2d63aba9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/mod.rs: src/stream/src/executor/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Mutation::from_protobuf at line 1015. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/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":"src/stream/src/executor/mod.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"450ef4858113c5b40557f73b5afe3cacecbae4bab8905e88071bd4f1e64aee65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/service/src/ddl_service.rs: src/meta/service/src/ddl_service.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DdlServiceImpl::auto_schema_change at line 1340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/service/src/ddl_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":"src/meta/service/src/ddl_service.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0751d13d384b0b2e3f23d7df702b46881ef66b1a28a3c54b013c0f961935a95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/common/src/system_param/mod.rs: src/common/src/system_param/mod.rs changed 3 times in last 90 days, max cyclomatic complexity 73 in risingwave_common::system_param::set_system_param at line 329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/system_param/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":"src/common/src/system_param/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a435445df8e28d051d99a94eee22b36c7f76b2cc4678aa1ba3bed1bbaea5d0b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/source/source_executor.rs: src/stream/src/executor/source/source_executor.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in SourceExecutor::execute_inner at line 616. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/source/source_executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/stream/src/executor/source/source_executor.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c3f8c475f90cd0a00abf81866b921be8057c50e95352d2e92792912a185a9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/risedevtool/src/bin/risedev-dev.rs: src/risedevtool/src/bin/risedev-dev.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in risedev::bin::risedev-dev::task_main 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/risedevtool/src/bin/risedev-dev.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/risedevtool/src/bin/risedev-dev.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2d963b9541d6ea7032103bbf6b3a15d4994e49d932f7dba53f74088bcc1c9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/optimizer/plan_node/stream_sink.rs: src/frontend/src/optimizer/plan_node/stream_sink.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in StreamSink::create at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/optimizer/plan_node/stream_sink.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/frontend/src/optimizer/plan_node/stream_sink.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3a4942e42256141194cd9251444d2dd0175107c3190dda60f352d73a8f57a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/sink/iceberg/config.rs: src/connector/src/sink/iceberg/config.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in IcebergConfig::from_btreemap at line 578. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/sink/iceberg/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":"src/connector/src/sink/iceberg/config.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ab95c1080ef37bbe9a7feb604f0d2cffb31f41a9f9ecd151f379011b86deaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/connector_common/postgres.rs: src/connector/src/connector_common/postgres.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in risingwave_connector::connector_common::postgres::sea_type_to_rw_type at line 671. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/connector_common/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":"src/connector/src/connector_common/postgres.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1143aa978b276d9aeb97c1739052a7869502d9a9f347be2400feca127a579fd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/manager/iceberg_compaction/schedule.rs: src/meta/src/manager/iceberg_compaction/schedule.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in IcebergCompactionManager::apply_sink_update at line 803. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/manager/iceberg_compaction/schedule.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/manager/iceberg_compaction/schedule.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07bc18770c19c70cc2e94cbfb62650086d05fe111d723a7a4a0d837a6741aa4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs: src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in risingwave_storage::hummock::compactor::iceberg_compaction::iceberg_compactor_runner::build_task_planning_config at line 756. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_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":"src/storage/src/hummock/compactor/iceberg_compaction/iceberg_compactor_runner.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddb1e436b584bc5778b81e88c35e9740118ce0f79804c317a59879021023204"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/controller/catalog/drop_op.rs: src/meta/src/controller/catalog/drop_op.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in CatalogController::drop_object 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/controller/catalog/drop_op.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/controller/catalog/drop_op.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c777242364d704d331ef1bd12aaf8ef0561a0b190809db6c50541fe41e232773"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/handler/create_table.rs: src/frontend/src/handler/create_table.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in risingwave_frontend::handler::create_table::create_iceberg_engine_table at line 1453. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/handler/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":"src/frontend/src/handler/create_table.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"127843795d7d8c1ffff2eeaf6a0c38e21891ed5d6e386d856cad464069e67190"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/hummock/manager/time_travel.rs: src/meta/src/hummock/manager/time_travel.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in HummockManager::truncate_time_travel_metadata 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/hummock/manager/time_travel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/hummock/manager/time_travel.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dbdf7748733b07cfd78a09e5a04b70e9ababd00f1c42bf7ab8db9e171aa451"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java: java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in DbzConnectorConfig.\u003Cinit\u003E 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.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":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/common/DbzConnectorConfig.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a75443a6d679cde36f7ef16e2dd75879cb81231e348ba4ca0b686ef8ee9c1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/planner/relation.rs: src/frontend/src/planner/relation.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Planner::plan_iceberg_table at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/planner/relation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/frontend/src/planner/relation.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdd6a22e77304ad4e69b8511b9e6701b9475e81da1db155a05d3b200bea2c94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/sink.rs: src/stream/src/executor/sink.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SinkExecutor::execute_consume_log at line 743. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/sink.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/stream/src/executor/sink.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c706267d85c32708152c58a53edc3ffdc0488fbeb1e86cb9fa54c73b78c637"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/sink/iceberg/create_table.rs: src/connector/src/sink/iceberg/create_table.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in risingwave_connector::sink::iceberg::create_table::create_table_if_not_exists_impl at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/sink/iceberg/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":"src/connector/src/sink/iceberg/create_table.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b3ea2ff42ed6cd2f7896ff8412df3f049742f3ac19aa0f88b4aca6063c83de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/sink/clickhouse.rs: src/connector/src/sink/clickhouse.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in ClickHouseFieldWithNull::from_scalar_ref at line 968. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/sink/clickhouse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/connector/src/sink/clickhouse.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c922067689203816f02d5296d2eea3d626cdc275c9eec45b0d04c621ef0985"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/risedevtool/src/service_config.rs: src/risedevtool/src/service_config.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ServiceConfig::id at line 646. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/risedevtool/src/service_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":"src/risedevtool/src/service_config.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca430adff00420303addfde70b9a7d00e0d94fefeb5104c937712fa2387f2d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/binder/expr/function/builtin_scalar.rs: src/frontend/src/binder/expr/function/builtin_scalar.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in Binder::bind_builtin_scalar_function at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/binder/expr/function/builtin_scalar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/function/builtin_scalar.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec83392061b071f0eddc01c61680beb59f9061a7c94cc3159bb660d211b00e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/mview/materialize.rs: src/stream/src/executor/mview/materialize.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in MaterializeExecutor::execute_inner at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/mview/materialize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/mview/materialize.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"02be0900e70ee7b2c638203d8ba195e07b81a883eed3694e8d86a32f425bedf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/source/cdc/external/mysql.rs: src/connector/src/source/cdc/external/mysql.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MySqlExternalTableReader::snapshot_read_inner at line 767. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/source/cdc/external/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":"src/connector/src/source/cdc/external/mysql.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a47238d258987aac998f8e584c38b541448b413bc1cfe3814dd163703024b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/hummock/manager/commit_epoch.rs: src/meta/src/hummock/manager/commit_epoch.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in HummockManager::commit_epoch at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/hummock/manager/commit_epoch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/hummock/manager/commit_epoch.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f34c305df32c6603be0b103f2dd39fe5d37019595f47be88cdb844d9a62275b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/backup/src/meta_snapshot_v2.rs: src/storage/backup/src/meta_snapshot_v2.rs changed 3 times in last 90 days, max cyclomatic complexity 38 in risingwave_backup::meta_snapshot_v2::encode_metadata_to_writer at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/backup/src/meta_snapshot_v2.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/storage/backup/src/meta_snapshot_v2.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcb9cbf58e6babd74ced9c226fb0c199ad68b5cf2e42dbecc038f1bea3f2a03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs: src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in HummockVersionCommon::apply_version_delta at line 499. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_sdk/src/compaction_group/hummock_version_ext.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d729e513d8b1479c9394f143f0c592eb9cfef7975a10e3532c09012ce2b3a412"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/risedevtool/src/risedev_env.rs: src/risedevtool/src/risedev_env.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in risedev::risedev_env::generate_risedev_env 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/risedevtool/src/risedev_env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/risedev_env.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"192149f3c473842cccc0ab9409594bc0f79036b19e44d8008d0efe4c2eb0a6a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/sink/snowflake_redshift/snowflake.rs: src/connector/src/sink/snowflake_redshift/snowflake.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in SnowflakeV2Config::from_btreemap at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/sink/snowflake_redshift/snowflake.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/connector/src/sink/snowflake_redshift/snowflake.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc095b9ae7438e8cc1df2d28242db2fb73d9373278258090c3c302ca7472f49a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/source/mod.rs: src/connector/src/source/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in WaitCheckpointTask::run_with_on_commit_success at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/source/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":"src/connector/src/source/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"739c74b028a06d863a05ca94c26a5b9a67dada8b77c689181c221932441702a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/stream_fragmenter/mod.rs: src/frontend/src/stream_fragmenter/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in risingwave_frontend::stream_fragmenter::build_fragment 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/stream_fragmenter/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":"src/frontend/src/stream_fragmenter/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a66933c02793248da5c174b0b9fa9d74fdb03b57927b26de7abe6a9bef4fb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/now.rs: src/stream/src/executor/now.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in NowExecutor::execute_inner at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/now.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/stream/src/executor/now.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6e29939c55c5e56191ea9ba59de5f5f29ce5e8829db646c6a22ab864e3f34a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/hummock/manager/compaction/mod.rs: src/meta/src/hummock/manager/compaction/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in HummockManager::get_compact_tasks_impl 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/hummock/manager/compaction/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":"src/meta/src/hummock/manager/compaction/mod.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43280b9f6cfc9e8454213a4420220c9509fbfb8471d078d87f0882cf33592d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/risedevtool/src/config.rs: src/risedevtool/src/config.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ConfigExpander::deserialize at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/risedevtool/src/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":"src/risedevtool/src/config.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b05a78926555f492309b38b3ae5d1b0641f98c13d696e88dcb42cc90cd2ae5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/risedevtool/config/src/main.rs: src/risedevtool/config/src/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Components::description at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/risedevtool/config/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":"src/risedevtool/config/src/main.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"091ef1a9dff309f7576f60d852246806c544c12e2e64913d674b8b7b44f8e763"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/locality_provider.rs: src/stream/src/executor/locality_provider.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in LocalityProviderExecutor::execute_inner at line 470. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/locality_provider.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/stream/src/executor/locality_provider.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2449b925473deedd6b2afe6f2f24da7056372ab3274312cf0692e38855f231"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/manager/sink_coordination/coordinator_worker.rs: src/meta/src/manager/sink_coordination/coordinator_worker.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CoordinatorWorker::run_coordination at line 670. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/manager/sink_coordination/coordinator_worker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/manager/sink_coordination/coordinator_worker.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33f0192a204d885a607fbc38de080a7e5423c2284d199e8ae2873f3a7582659"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/handler/create_source/validate.rs: src/frontend/src/handler/create_source/validate.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in risingwave_frontend::handler::create_source::validate::validate_compatibility at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/handler/create_source/validate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_source/validate.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a5b17a2db0b948a46423cd178993992fcb6f2d983c9da1a3b281ec648d44ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/parser/mysql.rs: src/connector/src/parser/mysql.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in risingwave_connector::parser::mysql::mysql_datum_to_rw_datum 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/parser/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":"src/connector/src/parser/mysql.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9d83f22fb3a98c36b15af1f02ff306fadb4065ae818f2c4b22d9373af9fe0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/sink/doris.rs: src/connector/src/sink/doris.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in DorisSink::check_and_correct_column_type at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/sink/doris.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/connector/src/sink/doris.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb6fd3af9ce936826e1fa3643f1c72e38229749efd98188dee605d22d2ed84c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/stream/stream_graph/fragment.rs: src/meta/src/stream/stream_graph/fragment.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BuildingFragment::fill_job 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/stream/stream_graph/fragment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/stream/stream_graph/fragment.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6803ffe0bb001767b17d7edf4b4f4643e9e8808720af27aaeb7f74555533207"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/common/src/array/arrow/arrow_iceberg.rs: src/common/src/array/arrow/arrow_iceberg.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in IcebergCreateTableArrowConvert::to_arrow_field at line 489. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/array/arrow/arrow_iceberg.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/common/src/array/arrow/arrow_iceberg.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ea0f56b4ac29fb7d8d5a4e9128af1c87be70124c15081b063ce120affac8af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/src/hummock/store/version.rs: src/storage/src/hummock/store/version.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in HummockVersionReader::iter_inner 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/src/hummock/store/version.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/storage/src/hummock/store/version.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b761b695061a3a762b70383dc43d411da2ff4604d273d0c2f5ad57fd35d09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/task/barrier_worker/managed_state.rs: src/stream/src/task/barrier_worker/managed_state.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in PartialGraphState::poll_next_event at line 882. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/task/barrier_worker/managed_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/task/barrier_worker/managed_state.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b7b71335b7111047d7918397e07ce4f3c745d4d69c87bcb7e6ab5f4f3d007a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/connector_common/connection.rs: src/connector/src/connector_common/connection.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in IcebergConnection::validate_connection at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/connector_common/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/connector/src/connector_common/connection.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38bad7cbe0b68253a3988c266a1a2e501853ab13fa66bfef8a3abb413e218b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/src/hummock/sstable/builder.rs: src/storage/src/hummock/sstable/builder.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SstableBuilder::add_impl at line 351. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/src/hummock/sstable/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/storage/src/hummock/sstable/builder.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"111561c112243babfe0bc3c7d1bd31368654dced43d662fd8578b581991f47f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/common/src/types/mod.rs: src/common/src/types/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DataType::try_from 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/types/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":"src/common/src/types/mod.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0910558f616081ff07f5253ab09b79a7981667843f9e4987e817cfae3e92ac1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/src/hummock/compactor/fast_compactor_runner.rs: src/storage/src/hummock/compactor/fast_compactor_runner.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CompactTaskExecutor::run at line 698. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/src/hummock/compactor/fast_compactor_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":"src/storage/src/hummock/compactor/fast_compactor_runner.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"390527c8d6b50872c0af6cc496f6e865afdc3f87211e8be483ff89afc23aa395"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/expr/table_function.rs: src/frontend/src/expr/table_function.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TableFunction::new_postgres_query at line 295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/expr/table_function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/table_function.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc75a864caeebe793eaace22958af290072cd2e00a66a984a3fced2472740ba6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/common/src/catalog/cdc_type_compatibility.rs: src/common/src/catalog/cdc_type_compatibility.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in risingwave_common::catalog::cdc_type_compatibility::postgres_source_column_type_compatible at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/catalog/cdc_type_compatibility.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/common/src/catalog/cdc_type_compatibility.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad18d85726d05ccb9467a4e764d116864bbd87e44d032c84ad394bfa8edc8a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs: src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BatchPosixFsFetchExecutor::into_stream at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/source/batch_source/batch_posix_fs_fetch.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75bf6557a77df9e3e3fdd4cfd24bdb19269889e1ad8a7e20b6dd3745cfe3a44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/common/src/util/value_encoding/mod.rs: src/common/src/util/value_encoding/mod.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in risingwave_common::util::value_encoding::deserialize_value at line 352. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/util/value_encoding/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":"src/common/src/util/value_encoding/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8929b1e16da71d32cd4e7fd068e39831a3cc35f6fc29a75b2393a3bb1db64a7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/hummock/manager/checkpoint.rs: src/meta/src/hummock/manager/checkpoint.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in HummockManager::create_version_checkpoint at line 404. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/hummock/manager/checkpoint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/hummock/manager/checkpoint.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd123d09da84c67729364cad655ac1f28945535a45b129d8144c81f64ed28130"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/storage/src/hummock/event_handler/refiller.rs: src/storage/src/hummock/event_handler/refiller.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in CacheRefiller::start_cache_refill at line 441. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/src/hummock/event_handler/refiller.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/storage/src/hummock/event_handler/refiller.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ce1be7f7af2c6b5367a85873cfc0ef8c2edbacffb1f3801cdb593c2541d6a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/connector/src/sink/http.rs: src/connector/src/sink/http.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in risingwave_connector::sink::http::validate_http_sink at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/sink/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":"src/connector/src/sink/http.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db4018a7da7f0f0f52b94027112dabfafa67c4f863194b3d44e8353dd9bd2ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/meta/src/serving/mod.rs: src/meta/src/serving/mod.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in risingwave_meta::serving::start_serving_vnode_mapping_worker 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/serving/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":"src/meta/src/serving/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"914932d9910c03c790b1c36bbbe5eab9c326428a068d46bb53fc5730b518c798"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/frontend/src/binder/relation/table_or_source.rs: src/frontend/src/binder/relation/table_or_source.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Binder::resolve_iceberg_metadata_relation at line 303. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/frontend/src/binder/relation/table_or_source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/frontend/src/binder/relation/table_or_source.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7ac069a7642d0f5f3b9e3aeeb0d925ca2cb560976223412c237127f2e65958"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/barrier/schedule.rs: src/meta/src/barrier/schedule.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ScheduledBarriers::mark_ready at line 635), 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(refresh): finish a table refresh only after all materialize actors and abandon it on recovery (#27041)\u201D; \u201Cfix(stream): derive NOW progress from elapsed time (#27209)\u201D; \u201Cfix(meta): fence sink coordinators during recovery (#27180)\u201D; \u201Cfix(stream): use database barrier interval for now (#27118)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/schedule.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/schedule.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9098544629d39acb139ec2cb9782c799212386f9557a076778fb84e87d2ed570"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/node/src/lib.rs: src/meta/node/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 8 (its worst body is risingwave_meta_node::validate_config at line 607), 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(meta): stabilize automatic compaction group split and merge (#27044)\u201D; \u201Cfix(meta): handle incoming sinks in table drops and ALTER MV concurrency checks (#26667)\u201D; \u201Cfix(meta): preserve recoverable foreground jobs after recovery (#26472)\u201D; \u201Cfix(meta): throttle snapshot backfill catch-up barriers (#26423)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/node/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/meta/node/src/lib.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdb3d9b31c6da2f685524417c872e02078b03687f344b40b6c2d2b9fcf12d3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/manager/env.rs: src/meta/src/manager/env.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is MetaSrvEnv::new at line 424), 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(meta): stabilize automatic compaction group split and merge (#27044)\u201D; \u201Cfix(meta): handle incoming sinks in table drops and ALTER MV concurrency checks (#26667)\u201D; \u201Cfix(meta): preserve recoverable foreground jobs after recovery (#26472)\u201D; \u201Cfix(meta): limit pending barriers in partial graphs (#26467)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/manager/env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/manager/env.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e4dec909f6fd2b47ccadfd553bf5a97995e045f8deaa12596a046e8d304d42"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/controller/catalog/mod.rs: src/meta/src/controller/catalog/mod.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is CatalogController::clean_dirty_creating_jobs at line 637), 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(meta): preserve recoverable foreground jobs after recovery (#26472)\u201D; \u201Cfix(meta): unify creating job catalog notifications (#26557)\u201D; \u201Cfix(meta): notify hummock for cache refill config (#26464)\u201D; \u201Cfix(meta): reconcile stale serving vnode mappings (#26352)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/controller/catalog/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":"src/meta/src/controller/catalog/mod.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98e94156ad9ea6c0bc2bf8f86363ba938afb02f045266bc57654908dad8681b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/barrier/context/recovery.rs: src/meta/src/barrier/context/recovery.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 11 (its worst body is GlobalBarrierWorkerContextImpl::resolve_hummock_version_epochs at line 727), 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(refresh): finish a table refresh only after all materialize actors and abandon it on recovery (#27041)\u201D; \u201Cfix(meta): fence sink coordinators during recovery (#27180)\u201D; \u201Cfix(meta): preserve recoverable foreground jobs after recovery (#26472)\u201D; \u201Cfix(meta): clear iceberg maintenance for user-created sinks on cascade drop (#26228)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/context/recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/context/recovery.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"f614d641014e538faffc3a520d548c9f7bcd3d35de93910a54a106c387704f55"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/barrier/manager.rs: src/meta/src/barrier/manager.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 4 (its worst body is GlobalBarrierManager::check_status_running at line 164), 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(refresh): finish a table refresh only after all materialize actors and abandon it on recovery (#27041)\u201D; \u201Cfix(meta): preserve recoverable foreground jobs after recovery (#26472)\u201D; \u201Cfix(stream): handle cross-db backfill creation stalls (#26119)\u201D; \u201Cfix(meta): clear iceberg maintenance for user-created sinks on cascade drop (#26228)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/manager.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"474f06d72ffc97dcfd3a5afb492250603885b6b44bad9acd118b345ca78dd544"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/barrier/checkpoint/independent_job/creating_job/status.rs: src/meta/src/barrier/checkpoint/independent_job/creating_job/status.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is CreatingStreamingJobStatus::update_progress at line 138), 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(stream): derive NOW progress from elapsed time (#27209)\u201D; \u201Cfix(stream): use database barrier interval for now (#27118)\u201D; \u201Cfix(meta): limit pending barriers in partial graphs (#26467)\u201D; \u201Cfix(meta): throttle snapshot backfill catch-up barriers (#26423)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/checkpoint/independent_job/creating_job/status.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/checkpoint/independent_job/creating_job/status.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d5a691043f8c524ed212d0cd6a24317142e84f82ba9fb6fe8ad81ecbd33202"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/connector/src/source/cdc/external/mod.rs: src/connector/src/source/cdc/external/mod.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 ExternalCdcTableType::from_properties at line 61), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stream): preserve CDC events during recovery startup (#27031)\u201D; \u201Cfix(cdc): diagnose postgres select privilege (#26079)\u201D; \u201Cfix(cdc): fail initial backfill on invalid primary keys (#26513)\u201D; \u201Cfix(mysql-cdc): compare unsigned pk with unsigned semantics in backfill buffer (#25947)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/connector/src/source/cdc/external/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":"src/connector/src/source/cdc/external/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7d8eb380d56d909c4da07f4d39a3d619a4349278c158e1f7370967101014a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/storage/src/hummock/sstable/forward_sstable_iterator.rs: src/storage/src/hummock/sstable/forward_sstable_iterator.rs 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 10 (its worst body is SstableIterator::new at line 65), 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(storage): handle exhausted prefetch streams during seek (#27161)\u201D; \u201Cfix(storage): bound SST scans and point gets by table ID (#27048)\u201D; \u201Cfix(storage): collect point get iterator stats (#26405)\u201D; \u201Cfix(storage): enforce scan range in forward SST iterator (#26480)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/storage/src/hummock/sstable/forward_sstable_iterator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/sstable/forward_sstable_iterator.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4395c913537e71f7a71374ff5ef9a084e5a5cbd4d8664a16a6feb4e9940ebdca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/barrier/checkpoint/recovery.rs: src/meta/src/barrier/checkpoint/recovery.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is DatabaseRecoveringState::poll_next_event at line 184), 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(stream): derive NOW progress from elapsed time (#27209)\u201D; \u201Cfix(meta): fence sink coordinators during recovery (#27180)\u201D; \u201Cfix(stream): use database barrier interval for now (#27118)\u201D; \u201Cfix(meta): preserve recoverable foreground jobs after recovery (#26472)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/barrier/checkpoint/recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/barrier/checkpoint/recovery.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c50dd32ed958368a4dbeffb62eddfe6aafd7cd5a7133d1f73c704fe44720d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/common/src/config/meta.rs: src/common/src/config/meta.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 3 (its worst body is DefaultParallelism::deserialize at line 97), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(meta): stabilize automatic compaction group split and merge (#27044)\u201D; \u201Cfix(meta): handle incoming sinks in table drops and ALTER MV concurrency checks (#26667)\u201D; \u201Cfix(meta): preserve recoverable foreground jobs after recovery (#26472)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/config/meta.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/meta.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbd6e3e58257d0a41093963cfd543cbcce7344f2f5ca44b39ac5e2dce652077"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/meta/src/hummock/manager/timer_task.rs: src/meta/src/hummock/manager/timer_task.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 12 (its worst body is HummockManager::check_dead_task at line 595), 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(meta): stabilize automatic compaction group split and merge (#27044)\u201D; \u201Cfix(meta): preserve compaction candidates across topology changes (#27042)\u201D; \u201Cfix(meta): don\u0027t panic on hummock timer child cancellation during shutdown (#26221)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/meta/src/hummock/manager/timer_task.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/meta/src/hummock/manager/timer_task.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83ccb764d94e400fd8ee02c0935f3097c3c592b4a818a0dc593c1b0a310f8a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/common/src/config/streaming.rs: src/common/src/config/streaming.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 3 (its worst body is StreamingConfig::unrecognized_keys at line 373), 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(meta): limit pending barriers in partial graphs (#26467)\u201D; \u201Cfix(meta): throttle snapshot backfill catch-up barriers (#26423)\u201D; \u201Cfix(meta): gate snapshot backfill merge on pending barriers (#26288)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/common/src/config/streaming.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/common/src/config/streaming.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1c91bd9a749800407ad4b2e26963204c60e5fb2ff219e5ac6b9c3c838a57c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/utils/pgwire/src/pg_server.rs: src/utils/pgwire/src/pg_server.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 6 (its worst body is UserAuthenticator::authenticate at line 325), 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(pgwire): stream query results incrementally (#26727)\u201D; \u201Cfix(pgwire): support configurable OAuth audience (#26531)\u201D; \u201Cfix(pgwire): tolerate mixed-key JWKS for OAuth (#26416)\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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 12:28:15 \u002B00:00\u0027 --until=\u00272026-09-28 12:28:15 \u002B00:00\u0027 --full-history --no-merges -- src/utils/pgwire/src/pg_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":"src/utils/pgwire/src/pg_server.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d625422b1442f6f40adff0722338b832e38b9c7ec8271fcd29a43ee0075e17"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 21 significant file(s) lose their only recent owner: src/stream/src/executor/backfill/snapshot_backfill/executor.rs, src/meta/src/barrier/edge_builder.rs, src/stream/src/executor/backfill/snapshot_backfill/consume_upstream/stream.rs, src/storage/src/hummock/vector/file.rs, src/storage/src/hummock/event_handler/uploader/spiller.rs, src/stream/src/executor/backfill/snapshot_backfill/vnode_stream.rs, src/stream/src/executor/backfill/snapshot_backfill/state.rs, src/meta/src/barrier/checkpoint/independent_job/mod.rs (\u002B13 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ae0c0f3f3fee5ddacf14c5fc463fd0a74e9ebe9808142a6947ab30a3620b7be"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 11 significant file(s) lose their only recent owner: src/frontend/src/optimizer/plan_visitor/datafusion_plan_converter.rs, src/frontend/src/datafusion/convert.rs, src/meta/src/manager/iceberg_pk_index_sink/mod.rs, src/stream/src/executor/iceberg_with_pk_index/position_delete_staging.rs, src/frontend/src/datafusion/iceberg_table_provider.rs, src/expr/impl/src/scalar/array_positions.rs, src/frontend/src/optimizer/plan_node/stream_iceberg_with_pk_index_position_delete_merger.rs, src/stream/src/from_proto/iceberg_with_pk_index/position_delete_merger.rs (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d5ddd5d4e108587331097f0ee3449573745d00bff0d0ae92bc2beb815d3e856"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 7 significant file(s) lose their only recent owner: src/meta/src/hummock/compaction/picker/non_overlap_sub_level_picker.rs, src/frontend/src/handler/alter_compaction_group.rs, src/storage/src/storage_failpoints/test_iterator.rs, src/storage/src/hummock/block_stream.rs, src/storage/hummock_sdk/src/filter_utils.rs, src/meta/src/hummock/manager/compaction/compact_task_builder.rs, src/storage/src/hummock/sstable/filter.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b52a021cf24650e65c1434ac48aac032f0430a5e524479356116f9b4e975e357"}},{"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: src/frontend/src/optimizer/rule/mv_selection_rule.rs, src/stream/src/executor/source/iceberg_list_executor.rs, src/connector/src/sink/iceberg/metadata.rs, src/frontend/src/optimizer/plan_node/logical_gap_fill.rs, src/frontend/src/handler/vacuum.rs, src/frontend/src/catalog/system_catalog/rw_catalog/rw_iceberg_compaction_schedules.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364d719fd26ffe1079b061b00a86ce48e41b8148e84becb254fd20857d9afa17"}},{"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: src/common/src/config/merge.rs, src/frontend/src/catalog/purify.rs, src/license/src/key.rs, src/frontend/src/optimizer/property/stream_kind.rs, src/license/src/rwu.rs, src/meta/src/rpc/await_tree.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"76bb8510693b85a14ac1afa84174c293c86f7e9e32049e847749551500457915"}},{"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: java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/PostgresConnection.java, java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/openlineage/DebeziumOpenLineageEmitter.java, java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/ServerInfo.java, src/storage/src/hummock/store/table_change_log_manager.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"14e3f5b136541a4365526343e788fba9e344b58528d6d7896fad1e850ebcefa9"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #7: If anonymized user #7 becomes unavailable, 4 significant file(s) lose their only recent owner: java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresStreamingChangeEventSource.java, java/connector-node/risingwave-source-cdc/src/main/java/com/risingwave/connector/cdc/debezium/internal/OpendalSchemaHistory.java, src/jni_core/src/opendal_schema_history.rs, java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/mysql/MySqlStreamingChangeEventSource.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"97d7a6809c969a5b0fa6513eccc5f010fbe1eed2bf4c2f39d3f02869c07f6a6a"}},{"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: src/connector/src/source/pulsar/mod.rs, src/stream/src/executor/source/batch_source/mod.rs, e2e_test/source_inline/cdc/mysql/cron_only/extract_direct_cdc_current_offset.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7c6a99e92a6ec14849884372be61dd145054c8451b2e6ced969b2ed61b93d2ef"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 6 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 (70 single-owned of 2006 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 2006 of the 2876 production source files in this repository met that bar). They are anonymized user #9 (2 file(s)), anonymized user #10 (1 file(s)), anonymized user #11 (1 file(s)), anonymized user #12 (1 file(s)), anonymized user #13 (1 file(s)), anonymized user #14 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reading nested arrays is not supported yet. See https://github.com/risingwavelabs/risingwave/pull/15614"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/csharp/NpgsqlTest.cs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6873df1695b32147467f97e48d97510cba95de4e6917df462f83a841d90d07d"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: commented-out configuration block \u0060RemoteIceberg\u0060 (10 lines)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bench/sink_bench/sink_option.yml"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c661fabf065b3fa92c0a6fae3524a921f4a59b4a25ee469d91c65da32692786c"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The README describes the MongoDB fixture but does not link to any documentation about the MongoDB sink configuration or TLS setup for RisingWave. Add a reference to the architecture docs that explain how MongoDB CDC with TLS is configured in RisingWave."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/mongodb-tls/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e711d8d4aab04a481daf5b922fd88c7e4dc02e4777cfbeb6dad64d4c8a697a43"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent access to metrics: \u0060BatchTaskContext\u0060 provides a unified \u0060batch_metrics()\u0060 method returning a composite \u0060BatchMetrics\u0060 object, while \u0060BatchEnvironment\u0060 exposes individual metric components (executor, manager, spill) as separate methods. This forces consumers to know whether they are interacting with a Task Context or an Environment to access metrics, and requires different code paths to get the same data.: Unify the interface by having \u0060BatchEnvironment\u0060 also expose a \u0060batch_metrics()\u0060 method that returns \u0060BatchMetrics\u0060, or ensure \u0060BatchTaskContext\u0060 delegates to the same underlying source in a way that allows consistent access patterns across both types. (signatures: BatchTaskContext.batch_metrics(): BatchMetrics | BatchEnvironment.executor_metrics(): BatchExecutorMetrics | BatchEnvironment.batch_manager_metrics(): BatchManagerMetrics | BatchEnvironment.spill_metrics(): BatchSpillMetrics)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"176530150bae15839be29a1a201f44e83a158c7302bbae1864b5ef8fc046e37f"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant/Confusing cancellation checks: \u0060check()\u0060 returns a \u0060Result\u0060 (likely checking for abort/cancel state), while \u0060cancelled()\u0060 and \u0060is_cancelled()\u0060 both appear to return boolean status. \u0060cancelled()\u0060 and \u0060is_cancelled()\u0060 are semantically identical, and \u0060check()\u0060 overlaps in intent but differs in return type, creating confusion about which method to use for a simple boolean check.: Remove \u0060cancelled()\u0060 and keep \u0060is_cancelled(): bool\u0060 for simple checks. Keep \u0060check()\u0060 only if it performs side effects or returns detailed error info; otherwise, unify to a single method with a clear return type. (signatures: ShutdownToken.check(): Result | ShutdownToken.cancelled() | ShutdownToken.is_cancelled(): bool)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3a174d34a8057ebace04b3686367205d6d3914b7d11f77f97379c4c1b6d31161"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a new connection\u0022 \u2014 delete - the NpgsqlConnection constructor is self-describing"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/csharp/NpgsqlTest.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdfc75ad7d96497c2ae6bad494fed978311fa614f178c349d2f52977b594d14"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Open the connection\u0022 \u2014 delete - conn.Open() reads as this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/csharp/NpgsqlTest.cs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f0fc9dd8913b9d11f3296348b6f9f810b75a6f499213fb1d66da86c2d076ab"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a table if it doesn\u0027t exist\u0022 \u2014 delete - CREATE TABLE IF NOT EXISTS is obvious from the query, not the comment"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/csharp/NpgsqlTest.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2b9ca9db53aa83a48130c3661a1c370378c265d394d2a3a5c234c368cc60db"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Read the data\u0022 \u2014 delete - SELECT * FROM ... is self-evident"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/csharp/NpgsqlTest.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acff7e3397c980605b52689bfb787cbf9c2c282eaeb3f01b6299dbe6ac41f21"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Assert.Equal(new string[] { \u0022array\u0022, \u0022value\u0022 }, reader[\u0022array_column\u0022])\u0022 \u2014 delete - the comparison and column name are both plain text"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/csharp/NpgsqlTest.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b95c3cc9486691d12a5b89ae7d6abe48c1001789e92f11fcd52e942dd58f67a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f33dc8c514751ff7947c992f12623481f16e0ed6d35af62bce9f491b15a5ace5"},"properties":{"commitSha":"707a0d2c51afc87c47e0750c5f7a8086dbdeccf3"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a483ae05136e9ce4aafd138b308bb112a0c4a1637326c44e5d0289ed7ed7a82"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6aa28e662ebbf49cbab84a07e5a82e9cdfe7502bffb88d00840d84f15022b700"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f8b18c5b36959bf3308fb7142801061d416eff4a5b6181274603080fcbf3e6a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd0d8c13efd35bc4d35b0e43c59c9360d472c6e2f3764140104bc635f8f8b793"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b0267d6694958fab85de4e4a289495dedeb768de50cbbbbd923b4a36d4b6864"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db79af26d6a880e437fb9f9130ef51f5e10b0a063fd73194a3fd51b2cf4c9082"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d42f537396d0ccc95328c33217c7a9ff618035beb2c689290bb5f38624350bef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8822e849eb0e288f7ad588697bf2b130bbd2fef973ad27a2e1022f95dd3f4739"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35b0178ccfc92d42c2a44f610b6659728ee74b0a544e299985d28aea01a3c974"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fd83766322017ce18115177bf2c26ff19117820d70a9d8adba5aa5b5036afaf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3965199f730fdd0d1b975961d5dcbbdcae92b90ce7e160dd18a0ebb9f7ddadf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a9dd6e6d462ae700dee6fa937fae671603acc6c7301f0904874354cc6ca45b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36d172419fd89d693d30d8ae2e946142d2b9bd70033aa3fa418fdf536533d862"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24884c1dccd4a8350acb4f34e75cdf02b4517168be0a2b0ecb901d2db90b56a3"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"538da1beac23fd0db4d02c638cf11447e1406d6451c58f6b45d6b2d6b72d89ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d882badba5d7b91587a43a34dfc5e0db49488e3665e0bc81854f78d0191b8f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75cfef4cb9baf00af54f24e8129dec5846e8ecd105684baf56dac78ddcb50d8f"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a70696e31de2fe7e7c8a8bcfac3dc24e36ad61d481c2710c2fca1ec0b1ba2419"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"733b632d2f5d725fd009c9d02e7f528b425991b3c4b0c5d5afcd2972e394c403"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a6d5a5538ea8ae1aa35757d135ad90a4323aa1732204d232ae527da3c23f230"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8342acc9f1872dacd121663b44f0a7c966cd7fdd96b55a243527550efd0ec27c"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68efd940445729a9a823fbe84fd1f7b58f0698fea236052df49eac2465de3006"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3d203b304acecb871de7ec9a6b450a0e74e07eaa53788cbb0b79eaf94dc2a3a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e5bdcbf10f38aa2fa343491868fa081b68b874b77c64cc38427f30e829319fe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abe5809a9e66df0026b9634e31b6b1305986ea6fd16ee978bf79e919a24f90b1"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78b64c5cfacfa205fe27e61922b54a150d09f8f3b89da193e96ab1a5b9e2f14f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28267fd5a22e496192b4f46d044c5de47afd6caba35aece88d9f087c06aadc78"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c713fc0f4d20c81375836e4f02380e5d445b90913d1931051d0b05e9d33f07d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d86ba6e256fbfe84fe071911fc0f1a1d54c08836c5e01340425f30afcb019af3"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b63d1d9a636e959546427ebb15fc0bebd85de8c3e2b72ba43ac6adeded16b148"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"186e3442479f949ba95b786d7b596da0d08a5f7e5b969109abb9985533a3ee0c"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9df8d6255f671e04e862428c249131fb9acf8b28589adc82d6b89b6f4550a38"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad8fb410003ed4cf3d82322a1dbfadd960aaf82a2b65dcd7267442eff125c2b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be944abedcf7b07ac0f581b6d5b22c77b472c4dd6fca651d81074c06b64977c5"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1784f0cbe60bcb627455c50e3193c3ebfa54a65fdb0a378716351573f6aad0be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c02f9bea17349ee0f07417141c47f79d4f80bfbfa624f14a40f47276db01a17"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"635d5cb85e894bf646c4024466fa446bedba0e66abc282b3e26d886b80f87a83"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8195f25c4171a38e7eeb03408486d594a086e8ac98a620a190ffce8144de2d1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcf5b5c63ff5b04bb033f025d3191cc1c27e4d557af502e7fcb2bebd74c8f031"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6965dc5acb554ea0b83ed452c527b433d855025afe7beb9b7978251cdbb3433"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94d39ff9d694490e8630c4d07c4b5f9b7a7f5b1c6105ceed8948b550a5142f5a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb46b33c13ca79b75a804e858a261e72b973c33cf4f6de74ac0922fc0721295b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86bb8fd820dd21756fa85ee7b9be1c8ef106bdf220177e528e2fccf71b7b4b69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e12a84d8e62efb7ff72f2b3ac3a78c899b83613ff28d68a8328001edfc61a413"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e0a4e08600b595f47724b2910975da7a425354f58442060c9b652df433a5171"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86bb0b38550a4e4cadc07914f29cdb6f233feeadf12370e3b6785846f6a18bbc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46b07e3537262c5ab5393e17e999b2aefe422f49c830905408e20c033a7ffe35"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2250af65e9e13f8b1c38ae255c83d977d1c8b7b255334e2fdbf393934639502"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea0afe7dc28843c64a9578487af3086dc8a6915f80cf4b018258bc9240ffccb5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"257ae1ee194dcb5d120a774e316f862ce19f31c68bcfe61d39d91e2a8965051d"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f9e84fac4aedaf06ae9c0e81864397c32c512dc27962fbbaec8d466b0058f92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5f3d15f93fc76289075472ed8a0bd26ba309f6ce11239434e2ba9f8721011a1"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b5060f48ae4d7401e96e3e84ef22064ef1fb3b24abc3b98f2aaab781dd42c98"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7999df2f086c754589ca07f841e7301376f8e2bab4f429ebfbb6a706f6bf580"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c89db257afdfadc6f3091c12e5e5aef54186ebed63002737e40010cf2e915ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ccf9dcbe53ef1dac14628a9ff144ef3bd7867b3187e8e087f9555459ca49bd47"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f6d45a2abfe28bbcb131a35689f1f94ca1cb63681537e92719576b7bee532c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55de41b0dbab5bb8f1cddc478871965fd84024c9a8c3e81095b45bf94610b085"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df3c654c30de1699403752c6c0078168e3ad2230369e948ff3ce0c07afdf4482"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb9f10b6e8e5e3a82ab94486eb2d83f91a6e8cf4be88d289fdbc50f2033e0527"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a67acc322f90abbb5d455ffbbbc517756e6f3eee75745c14a3d308640dcd8b86"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1c8c8da78207c71d313d7c46cd0f58338936e1f892df95b197a44fe484c2dda"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12d688868eb009447698aadbaba625aec55cc08a3a2b1bf5679e023289374c31"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe07abc3170d96485f7f8bb930048d29b6bd6cbb37a3446fce3b6c9f6e41cb52"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecf7b474fa82cc4aabab01b4950fb15a206a751e5cd7c1a82cce7036a2f6e06b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0b064acaa01e14e50f509407e43f6e0a4ce573be4c87b5fa14ce94f8068f1bf"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26a2bf7348df88068bbc066f084447f55ccf8b3078b209986a3a0c09e5fb1cb1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7ed3057e00416250d225e16fc50a8099a04fe93c1102ad06617cff2d3716376"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d8137e2843a4d9ace312984d4d1b8b07998cf19f7a31e2c7e904de2ca9c84a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5347ecec7591170629c15c4fa6ca3de2ee2c5ba0078db47a37988365a2931868"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"416e3ea648f53fd71451b3bfa279fb7525399a33b594025b7190286daa505b71"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"679f1802c59ea291940d544d9745097829dc786ae763181f222d9a4f623633f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cd80ab36a05d37c0c81cc49376952b773608954d7220e3649480b59a8aedfcb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60f162b64fea90ecf954e6efbd7a1e9d9f0263c253d9b6043fbd98713e8f691a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"405682205e8b0e3aa92b8d8428a109e87bc576fb21b6871e9848c49852961b06"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff7252db9381a238e5b174ad3fc98abff5150f1a5b0cd08819bf1141cad75ab3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fb6a4d8bfb1c5534408e8884d85658f52e2b1ffd1751514c1ab8991a72823e4"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6911a1a8469d02ad2e7f4e5320ad7001a87a14fb496596be71379db68f5c43d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff359b34e71819ba80649bd993e9a73e876c7023c1d1607eb25844d66e85525b"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bb24cca9ed122d28c973d010a6ab2313aafe6343b7d4141edbd52bdf0e67933"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe5b3c49590e9f8f74979d269b126100620dbb05c0e317b191d8cf4c723f62a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c82f4ee3f44696702ad683940c4a4549f59feed23f49db0372745698a254e3ff"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2303cac60f60fa6a5d25f5e4bffeee18d3785f0a1a2e20cd2b28388a850c22f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b66af834e1e2f19466057db201b6ab401cc4599f94f2a1ca6e94aa52c1b86599"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"687ad0e4b96af321fc687fef40371d84947bdfa3186fac21aa0f721b89d5c543"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b7d95270bc6547b2bc43c987302441554b03d3c58aed6d243c9b0327be7fca2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7571a6206278d3a56fdeb164631b0c5f8e2b0d921f8234e4f76cb0e4d654b934"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07ebebb2fae3d7c09d40dde8aa22d9b840577e81c9b094262fa0d4f5cecf08ce"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35a4e93169e984ba06d7af07788c80e7beeee25425632b67bb1730d46d000b8e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8f28baba4e1c021184d99e7efbe54a48a19acb75f6cdfd723b1367c6907eebe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"293482b6988dced0bf8b8eedd6b92d36b06062a6dce60d44f12bcf23f359572d"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5dfe73ebe0bb784a57e4028afcd4a456f701414c33421ef7a18858d7f9e7bc6"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c891ef5fe9f6872cd4cb452ea96079c988a452ddfa5bf037cd633a193c923e64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ef4461396e16fb82326a51d86c37955c2a42bc1e61afce730a510451a5653fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5393e4271b5597bfd855df83c1ac2e4194483a3c25aa3aabe43badefca87d63"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"979008abd4b92074c33661b0fd53aa0c330800e45c40aeefb311b86bf8bff19a"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3426d3f1f15e72909f44871b380d297a90034dd0da0c95c74a2d2a60fc29747"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d2689ff3becd86873291fe6c6eee6f0d03c095833fc127939a5699ca5fbe459"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f936b553be505229c435f6541a9509defb5931dbbed5123312cee1ba78b7cd1"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b156160bdd047ecbf5e36dc84b3b0c332d1acb262ec6de6a9ec3dd2f48c4b09"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee319381aab04dc1f8485bb49fee262521c4dcfd1f39efecb1ffb68394b1234a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39341cadca99d9be74e375503cd71a599c928f9d045569fe359c4e7b46f9bcc1"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5737018c11859d9c3a568edbab99e93ce6e9c7a72a70fbbdbfffcdc320eb3572"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f1e4c57f64643fcc6f164f6331db3690edbba077fcf1a451396dce877da9951"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f77f9bce72e977c1e0c9716deef3132397cfcfb5f11ba6624e6cbe52cc2966ee"},"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"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"118241a03946d26ca4e866627328c817c84f44deb652b84f28332a7fbc1af259"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d80116775acea6b887247b7d349854043620bfe07e071f62a2ea2d81df1a7b54"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91149fcba6aed418f842f9f3e26ca527d6acf35fdaabb920e4ea958bafb528d6"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecbff95a1503064bcb2671300cdaf74db7414ed73f8bac698c0b95fab7175e2c"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b7167120d7366b07edb131c1c251d13f114bbd2f755c8545099ed77174bc9c0"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99e35ccee1d77ac24480ac4a4a7ccd17aad0c702bb9796fc9b134ee000158936"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d988453fff19ad092143328224f22ce2cc9711c7f6194ced6769718ba1f42e1"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a34f829a7e1fa3f01c8e2323f8e4bb95a02739d5ad6a53ff0f31a27dbe6e441"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64c0a321f22cd832685793023748c1e14a9aa02b881051b0d150a711de4f7541"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0978d034a8060773bbcecf58930012faf07a54a3eed67a227e6e08e27f393a3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4d07380ab81c6657ffdd381e4358b5fb031f615579072c0e0920676a5b1bd03"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc5ab6576bd70afdcd46d33bffaa4365e49fb5f3a11b632ef27a5ba63452608d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35d4b00bd7ae2c07f6afaa99771cef799cd4d7a58cf7485922508363a342d07e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59289c83b62fde566850acfa5ce8020df40658f60bc2f48078957e7c00b5c8e2"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2ab1695e8c6a8443e2f3f4eda24cd9b410914ede1769aacec998afb60ee8cf6e"},"taxa":[{"id":"CWE-78","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":"9c7c6d7ad14579cbf4762db3e3121ac2b33ba554d5dab7bdbd7faa776987eb10"},"taxa":[{"id":"CWE-78","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":"7fe4a387a702961cc5730fc7c0ed7853dc6bb6ae5f0aeee61fdec9f4065e5e4e"},"taxa":[{"id":"CWE-78","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":"e2129dd69d29dda07b13c0735d0fcd01e1796695e4f2918afb19eae48c00775b"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6199f41830345d8fc6297e08765c899ecc4b0d50ecc57048875634452b2943a"},"taxa":[{"id":"CWE-78","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":"311c2443c5daaf2a9a639d3fe38c5dcbefbebe5aa10c7267976dcbf12cbdbadf"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f43c825408365920619ca1a5716cca1fbadb89eee6ec35f4af65b160ab377c9"},"taxa":[{"id":"CWE-78","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":"060f344a0ecc1e6498c96cfb4fd3da34cabf44d8240ccf7094f6eab617eaafcf"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ddd7110b9334b7748dd2e36633f0bd718d1d53dbbe243bf141b1ec6f9f4a427"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.101.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104"],"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":"2a3bac80ea0155f0b28bb70c5cd5d3f8d9de9684976aa9330d3597b26a366e6d"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.102.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0049","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104"],"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":"a6eea160f628d9d8ed287f0540ff0c23219a91a0bef833bc04455e0e965dfffb"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104"],"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":"049c81fb2c434631bcbdbaa9132fb0dc492caf58b0a5f13d16a8018c79a5287f"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[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":"38748b7b72f9585f252df2c4b4955c2c894adb2a78aea50e1be5391de5b81fe3"},"properties":{"dependency":{"package":"browserslist","version":"4.28.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35d78042cdfa716793c8d86ca6a84c7e033fac31782109a5a3601102cf082b2c"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.16","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":"08227c62b192a74f760a48d199017a6c31cc0917c3373b2b4f83fbfda53fb1f3"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c430f51c25d079e0fdc603f98de7a08790e1dfa5aeeb424f2d1aba5456169e1"},"properties":{"dependency":{"package":"thrift","version":"0.17.0","advisory":"[GHSA redacted]","aliases":["BIT-thrift-2026-43868","[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":"525150c79769e3a8552e1d639a767bc181c181d5c769963ba9e0faa9d03741e3"},"properties":{"dependency":{"package":"opentelemetry_sdk","version":"0.31.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c99faf45650c5583d35ab90d02b7a7f366812e6b6901ba0afd35950e9e1f916"},"properties":{"dependency":{"package":"encoding","version":"0.2.33","advisory":"RUSTSEC-2021-0153","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":"0.4.12","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":"91039113a5812bdedea5059528df777edbb804825be9832dff6710e8b7afb219"},"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":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.12","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a1e503af806e767f14c170c32073931de1d4295405a897beef69c919a99a60d"},"properties":{"dependency":{"package":"adler","version":"1.0.2","advisory":"RUSTSEC-2025-0056","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":"a42ca7416279f52063a649dbc505340ffc7c7a5727193e601ae1de8d6db75e3d"},"properties":{"dependency":{"package":"fxhash","version":"0.2.1","advisory":"RUSTSEC-2025-0057","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":"5c9622907b08df80e0a122f456ee66d0ce4e4d94c5fb643690760a0ecb9f042a"},"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":"1dbdbefaacfab6e56ed1a1ca1c6808a9b20b22e530de2cdc7c59a539199ca279"},"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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","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":"7d885a6c3524cf72fd5a2ed03e9e79b3e2b2b4c2a38e5f00b3f7bb7e4044b710"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","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":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","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":"bbe030f8c1c144f826bad4cbbd83ebd5ea8dfc9162bb9621a856f9f966813acf"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0002","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":"157c964794f60b32caf6291973d16cae595ce4ffeca193947ebdf8a1e7bca222"},"properties":{"dependency":{"package":"lru","version":"0.14.0","advisory":"RUSTSEC-2026-0002","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":"d44a25813d8a9e18eb42fa5350a972c298292d454155c6472f091bfb670363df"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","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":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.5.10","advisory":"RUSTSEC-2026-0186","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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","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":"1092cdc16bab90e26caa98781415518f2a1a0fec9b43d183894264e01dcc42b6"},"properties":{"dependency":{"package":"event-listener","version":"5.3.1","advisory":"RUSTSEC-2026-0221","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":"9e6ba568b0ed0abc545e1a95f2ff0a467ff21c2b7f8ad4d70eecbfb8d184c395"},"properties":{"dependency":{"package":"lru","version":"0.12.5","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":"4dda5a65ee0a6cd6d0cf928ea2fa242f48109975b161725005bba572c0b265eb"},"properties":{"dependency":{"package":"lru","version":"0.14.0","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":"6e61d22420646332cfb2b186a983fc325dfa4a51e29a6dd423d948614baa100b"},"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":"8977321aecc28dedc7f149b649deae898a3d3083d35bad2f5230fa177c5ae0c3"},"properties":{"dependency":{"package":"tokio-postgres","version":"0.7.10","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0178"],"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":"a7ac1525ee21f8396482ed6caafb5092cc4f1f938990a606ace871da2f8aa6f6"},"properties":{"dependency":{"package":"serde_with","version":"3.12.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.26.0","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":"2b12450bdf9717b94caab76a31df6989726f3f28292dbe6c6bdee37762db576b"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.0","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":"0d951e1d1b2d0554d17f1f221176a4faff1b041abc17692fd9843f9455aafae9"},"properties":{"dependency":{"package":"wasmtime","version":"36.0.9","advisory":"RUSTSEC-2026-0222","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0269"],"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":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.3.26","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":"3035e85b1a9c0c33df37dc333f490439b3fa52aefda24a401e2e75a177cdf778"},"properties":{"dependency":{"package":"rustls","version":"0.23.35","advisory":"RUSTSEC-2026-0285","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":"b0ae353ecb20b364d7bb58c2e86b89982dade6d6edc284a7c2692eb47fff69ff"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64be36d3455ff504244def582c6599baf9ea4c092a81976052efdb1fb8c6b0e9"},"properties":{"dependency":{"package":"dompurify","version":"3.4.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18237e95246881a8fdec134d658fcce94f0e692de1bebcbe21bc11d791364fff"},"properties":{"dependency":{"package":"paste","version":"1.0.14","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":"f9a5d3d707f5e29c5e532452f66f676b666be5bf2a2c36510057e7495580f791"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0183","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":"af120c9cd1095b6a8c5d7fb3ade39d9a96109303d79e4cd49b312d6d4a46ac6a"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0184","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":"844dd61ccbaaaaa3e28d8f58a19933b5398d8f2b57cbd3709cb8b10ffc75a47e"},"properties":{"dependency":{"package":"anyhow","version":"1.0.75","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db89b74b9d618a8997b8736775842bb02b9d492ab804b7dc3e1e352f28b1ce86"},"properties":{"dependency":{"package":"rsa","version":"0.9.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40f430c177ddb76869278789b4bd8983f72461790bebaaad6f36fa7ca14ceb7d"},"properties":{"dependency":{"package":"aws-sdk-s3","version":"1.102.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3f881934b785e048c045b04101b6f40c8006372488f66ebf72d320c521379ad"}},{"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":"c26de3b2a30ee45b7256d0cde093329ae5f2273c6e8cfe5be92a17f8233224fa"}},{"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":"8e16bcfaad0bd6a8288466094d9989c045ace79d54152ff12473e4a956460228"}},{"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":"b824eae0fb76ebd1ee92029f9ee2c996e5da9360b242911da51cb72fa1555b68"}},{"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":"5f662cab596c38e66620ab6acf518eb2ea8084bbbe0f309f3f91e8a41c30edf8"}},{"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":"1ef305458c873cba9462f459815283e5392972ca0d40c886f140d20081b1191c"}},{"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":"99b1bef82e360c23bfcce20d4ec90938a5e3e82cbb90bee491d47c18340cc109"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2cc5dc057baf95a508377f87b71dec44b574129f4463e8c83dfb2de9ac374882"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f29abd4df22a62e6313aa030cb4daab6b862c36d03fef34533103b04f8352dba"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3ff73e2973423842b3cc3e00ce5100c098be438a34306fcf09d98ad483eade17"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a52171f12c99b50cb1ac53c8c44d8df54666a57fa5d0c744101e553018e61ebe"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b420929ece4873adaed00955a14436f743eaac44db9ad08756a5850b38324b06"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5d6166fa70a7b812b9b564281c6e94161f5402646cdbc149911cb30048d6723b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e64ac286e1ccd99918863d7933508399904e375c938d40c2504fadc6dbbb20e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"38d18c7ef42d77b29766566164939e21951862ac7174fab817a553c0376eaf34"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-653","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b5af828d0a522b3f87c797bc49b0cb910f57dc7835ec9a7f396261f5fadbc94c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f37e6ec20c380d60a0af3492e6ed0620f605854e19aa706b42c2f387aca74d60"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"03d6027d6ddea15bf4a764583dc1282712a5abd5176bea49cc505f444a2ac24c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"38d570ce11f089f59e770dda108cade4bb6f5b391b7eff65e5cd16bfae65160d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"59681a3ddc0fb367fe63ade241cd34e6175793c97f480ce17d8105453f6fa8d0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f9deb0b3e9568df1171bacf908174d514cb7e71041f1c1975b38340d1bde8fc0"}},{"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":"d8042d71c3ace85295488b8bbec2dd055d95f34c7360312cff317f12dde7e5cd"}},{"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":"b48e5b3cdff105291c97f8ef2f285f622680adddcaf7a2cd14434b6856e43ffa"}},{"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":"434a2ada5006a15d805952c5a6b9aa1627dfd116cb9daee3bb50e7d8619ed6bc"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"24588eaf64fdb44db34b09481d9392be36fecdac580cb74f3ce88c644aed6e43"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9628245e69c895906b9af6474b3f9b3c165036040ac82874b92351c66454fd73"}},{"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":"1440180a89abd269f52fccf44a48b8289b83103aa380da28199be5e31feb3036"}},{"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":"7e1ae2350db6565e47566e93de2c45864645eb49abe49622261d0e1e7d4148fc"}},{"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":"a945f4e1b8a0e000b303f5bb5f362c969095d8b62548bb2dd4a18b246f870ac7"}},{"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":"613914bd35bc5b875814a2f98b34125fd2f0b89b9e7b7f2e8adf8b59d1d3d36d"}},{"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":"96a3abc92a01bc9f2c9cf6b31e44e2694f7663f6df4535340e2e585132d09705"}},{"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":"4a8a571cd0b5c1c4ce32d7ceb7754d02042377e6f9c4d7c87ea49e5296b78db2"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c32fe018ba8aeeb1054687d982b57d82476413a27419f21e404752885b78b4f4"}},{"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":"8c44af002094bb024aa151182bcc223d6bed58e83a65ba671a97b01a2be0d941"}},{"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":"1c04273f9ff2f8b1a9b73df4378f777fb6ec8eee48055782f675aea67ff45f6d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b55d292e1e732161172b22690be59371836efa89bccb4b03e903b4b71bb4764c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a0b44a99147ce2be07fe911c7db0285e249b876c569055359f56384580de3729"}},{"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":"fd85036a490fe383e6577ba468212227bb4468f48ab960b07d7dff3bf16dfd02"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"db1abd578556d545b37638edbfa688b933fbd789be85292f83b16cdd8927cbe3"}},{"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":"73eb836d76ed34441e69128e9b3323b59fb94d7087dc32b7c00639d561c5a3a5"}},{"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":"7c64f16abc4b3a9f8779f2416fca25d5598494fff42fbacac081d196b7aaf820"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ac70037f4c4ae1bf7b617ea3bbf64f56705bd2e9aef1a7e59f9cacce5b049471"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9482daea4def2002e7279a0e93847869ce3708f9d8cc60b1ef4fe69485d16b36"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"20224ca0a6999b4b68f64b65dda782ae41dc67fc24e422383500f441e35f15b0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5a72a6dd966c67b427a757c64bc3861c971e48abd42384ae18fa877f1502a8a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"7bce0fdd2ec717aa403c00267657beb5db75009790ccd33caec093a4b6d2c2f0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2c68d5beb15d9ed58bef7491f8397e2ed3a32987ced3fe6149a5750301272c1a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e72a949892377287f4200997d4c0023abd3b8e5795a19db7f91c925b065039fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f8e4db3200626a2e586172624d361602ec9b3d4493914fb1efb6e60653733f5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"699ed7870980633285f0c7f5dcfde873020897feb39ff39ba3288de99927658f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"999dead43cd7beecb77d870037b73199d2c28a495c8df985ca52db4745a1bbe0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3a64c291ce75b3161face4545885ab66267601b5e3284a4811660905be9c9100"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1bd09f4a4f12a8b2f307bcaadc6efde2c212a1b7965829dd204225ef593c2b4f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"eab6a8185d0309644b60e19421f4e2609ebf51b4f71cfa6fd98a53fe430281c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"be9bffc638ecc5c71a1ca5069a0904175edde77b75beefac0da0fc5c582487be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1be18be36ea173b2e64d631a9e630cef405d73cac75531029c487f18c9e2790f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b72fee5a8c7c7a6ed25a4925f0fabad6d159e2cb0c07e577c8af0a1439c5c4e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c6f67396cc5bf89e65eda8c559afcffe8241e354af8cf10f53c19b60a7e0fe1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"77cd8ab2fa2327363508dcedfc9bb55b612183770904d85df400ec4ec75430ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"57dd97a55e862efb7fa8d571986d717caa28e6fab1313f49d624b0f76797db8e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"7d51676eb980a1f0fdfad7c95ceb8f52a0e6635d59773a2765c0748b0896d272"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6b2465af5c516610026f54b8e2c647912e3702f920c5a16c9204782271798002"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"62f4216bb48ed58bf050465bcf2efc30c4b9a0929e7f8ba11b561f58d211e947"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"af4b4e8309e17750ba7ff25203e49efb2f626d5d3b8a2a0fabd6f6d2f1eac282"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2d7c1cac6809c5bca4dfc8e7e4e9c6f3765109dd270226ea82155b32fe69e21d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"81a0426cfe8ce232ccf12b72240c282f5516d693bddc9f467d2f08f752ffd46c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"152adc0fcfeae1fca35e9ad6115d313c6843830aa263b0ddbad06f7f8ae466aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4b7b01e281522cfa5addd298f8a9bb2a32e8f92e020c7f18674c935a3320dd6c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f3802f1630b74b92ec0299d9cd7984a31a497eae228af0e6f0cc63a0ae7275ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ed8d408c2d0ea8f493c664b439f5944ae817aad3b4b6ecccc9ee80da5f4060d3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3a2741b28b350dc208605612040d65352d36b60e09fee418e29efb34129bbc47"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"34e2546f73e2a2ab22c40dbcbbc033be66ef869ca12de41f15e58033d38088ad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"bd8525375c652113d273c8b6fccb72b49982aff1f6d21be0f8abc845576e7ff5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"072e29e0f6db8583f497200ffed3e1fae85f3a9a1b5052fa397584fb06521c2f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5fa8a3611e19809af85cc9d29c3f3ef3934ea0757e7df799f0e3d16b9bd13e1b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1eb4a1993fc7529ed78060c6b467b40999ee33606cefa90a516a7891c06ee251"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5c34a1685c2845806151757e164370be34e4798aef06c499bb968862bb5d2be9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9b445c57d3e4d7aacba04d45a3f53d4ff4a94998f7766046fd77704f1eec1c2f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b876f47d641417444724e262a8da7c6d0012d978f714d9c0d4642aa4fa4e05e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d4c940961003e32c5ed816b2d5a9103784255aeffc571549f3561c10f5e4bfd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3a16204e709f3ca306b654b2f39345a487ed4bc0d9cfa469779e30f048265075"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"062a863e52f8ea14788a381bd5d72a1ed7628f9bbb9d9623a54680e35b8db3e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a3d812f3f2026d4f10a6c8163681317c6f6aac162d7fb9646886c79f004bf8ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"925077e47d69c6d1dc10d20e4effde5b5a6b6750080a390e1cdee72bea768d53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"bd432a116aeb4f048da63840835930ddfb56b3879fc9e59024f99ebc4f670564"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c5d440f48190bd9376527828eb9d831eb4f0b4a703467cd263c7a4afe4637e9c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"130b5253ec46205d39eec25273fa863b45fe0612a0670d1d5f2aa074eb015405"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e3bbfbcc5435abbb379970846579ffbba2b80c2cd6c73e4b0aad36106ddfac62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"fe53a74d5784acc0412648fa65fd391db199687c649075076a9fff91e9334418"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c331aea7e11940c9dca1765ff204559633a59b27042cdc12f3842a6db924089f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"fcd924fea2df06b6e01c2ff737c793a7f69a9c1b61cb36177dd83f140ae4960c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"456d2c3f511799653c765ed1632fec68481d07b1aa9db4d76a6f5dab8c714fd8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4547887b6dbf3c06b16465769091ce82fd079464da0a44ee93043bc641f53bb4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"27ca53b5e6c07ad27e6dd4c5b5570d544cd2c1441215777333e727f35dddb32f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"58055ce85a65d5306aa78a77761fe6f2a6fb287ffdbeddcdea7bd2e6764534cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3c9e1106d5f93a07ab0e1bcd0f9766129d6b20871e736d33f00374b7c40a20ad"}},{"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":"c10e391a0b81d9ebef148e8366291058bc585edf6a86968e734dfa5e5c210367"}},{"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":"9e5e62aab2a732f50b490384d19a15984f410a06352a48e8c785ac1bf3b0c5b2"}},{"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":"66095f03be1bc683b792b17ca01b2664f8a0ef1a582c55d203c4b4c9103cbbee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ca10ec0a84303c8e52b4b00d933146f3fa027029c748b1c48019c967d6c7a3d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0819dc9686d99487f32cc64e1a7deb91806065f9a41290b009bbea014b375138"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"14daa2465c22110afcc479c244bafdb3ba024383a673ae6155c0843a990abeef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"489df6c98af4af88e145b323f02ff051843026bd67f384d9ed4e275d65f2f935"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"212287982288c9834861c5e807fee2f812b6ae03263b1fa39c6b3af79cd92c42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"be8fb4c4db62c1c37505bb53d3d5d34616293de836f2725d497ef4d4b1c6265d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ff0c945e11ed4f72f965b97d8ad547abfa54c9358dda01d00e359affdea5acf5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9a986f3eccd9c87854894fc0056a6559b85e0d9f9d963eb7d1e2a32a62451be8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f5b311149de964dad1f9b25ad82c9dd95bc48f82c0cb96d5dbb7a0681cebd949"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2f7701969fe91192634c497e5b884881186408f7eaff555e3ebe867fd3c5b3eb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1b759d90477959862829697ffdc99b3a901bcf57e7b2246565912bd6bddc818d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c20f95d13ccf3fc4698fa8fa2f268b8b3503ada822760395cb72206f09bd13f5"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_graph/assignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07079dfe2c2f60462216715f2fb7ec8fa1e44aa0664ded53c3627849c67dafbc"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresConnectorConfig.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6670d79066dd33927c2030557fbcc4e6e6dd71ea6ee9c5e26483785cad46207d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/over_window/frame_finder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea4c1e52bdfa496f8f76c2e7b630caab49099ccadaccf4d37f89262d96404b5"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/error/src/code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e9fb678597a2e2dca0d6187ceb6017850e2eec5794aa47ad3938280d623140"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/connection/pgoutput/PgOutputMessageDecoder.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba1cce9dfd9d6298e71c629ec6f6d205a114475bddb947cca2c9ac23cfee9c2"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/resource_util/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"765e880aa61aeef99387b9303fb12f44da9b8f3a1e6c0af91a2d078fce5914d5"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/rpc/election/sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a92cac556cfe4ddfa7e83197d734490c9bcbbc72f51e8d1ab2694e19980983d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/cmp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f9cfcdf27ae680f2554e452cdf5f6543ff57dde6c442ab4dc52b3550700bb8"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/check_slt_coverage.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"983fd3d85745b27e757b092be6014c7070bfb703ff5d287e142bdcfa3f2cde6c"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86184d7678837abfc4ae7ff93de2531d90e54ef68dc031e2f3a45174dd62406b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_trace/src/replay/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b5936d6aa451b9697b24f3e4043bb51cf68a357f7747cc8dd768d2093b036e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/delta_btree_map/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"462c6e1b16ce4f55fdd703233f2bc2bbddef9888d898b532406752750949a094"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/model/migration/src/m20260311_000000_legacy_streaming_parallelism_session_params.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"502397ea9434e87b235f2d1e3d9023a092fef5ad4f1a3480c8dd692901790a23"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/trigonometric.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35532fc0dbcca714952bcafd92927c8d585942a3544d47dac413f18a6a2ca8d5"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/delta_join_solver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb8d23caf31d7316582e498977a51d946d19258ea8ca38c856590929e427c50"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/property/func_dep.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5b9a98c30308e94ba6666a91fd7137e9ce3cc0e9444dff43963bbfd4c6057d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"grafana/dashboard/dev/hummock_read.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72069b8d03aedbb1b82c23d5d5bf55358a457fab2d2fc67104a47ac4ef8da85e"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 416 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/expr/impl/src/aggregate/general.rs, dashboard/components/FragmentGraph.tsx, src/expr/impl/src/scalar/extract.rs, src/common/src/types/num256.rs, java/connector-node/risingwave-source-cdc/src/main/java/io/debezium/connector/postgresql/PostgresSchema.java, src/expr/impl/src/scalar/regexp.rs, src/storage/src/row_serde/value_serde.rs, src/frontend/src/binder/expr/function/aggregate.rs (and 408 more) (433 orphaned of 2006 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 2006 of the 2876 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: pure.rs \u2194 strong.rs: \u0060src/frontend/src/expr/pure.rs\u0060 (context expr) and \u0060src/frontend/src/optimizer/plan_expr_visitor/strong.rs\u0060 (context optimizer) sit in DIFFERENT parts of the tree yet change together 93% of the time (43 of the 46 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 43 shared commits counted here, the most recent 3 are \u00606e8b2689\u0060 feat(expr): support volatile timestamp and uuid functions (#26362); \u00604339a18e\u0060 feat(expr): support array overlap predicates (#25597); \u006055bf4572\u0060 feat(expr): implement crc32 and crc32c bytea functions (#24964) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/pure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d5d16407026084d54303c4a3347459ae27b977409d6d35cc3a6e36c72c93a1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mock_hummock_meta_client.rs \u2194 hummock_meta_client.rs: \u0060src/meta/src/hummock/mock_hummock_meta_client.rs\u0060 (context meta) and \u0060src/storage/src/hummock/hummock_meta_client.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 93% of the time (14 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 14 shared commits counted here, the most recent 3 are \u006068694f40\u0060 feat(compaction): support manual compact target level (#25765); \u006078494334\u0060 refactor(meta): improve the determinism of trigger_manual_compaction \u2026; \u00601611e1bf\u0060 feat(proto): introduce iceberg compaction proto (#21778) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/hummock/mock_hummock_meta_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcf214aaf09916218586d6477b9698af078e1f2b1f069b69a136b11455e9a45"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 meta_client.rs: \u0060src/meta/service/src/lib.rs\u0060 (context meta) and \u0060src/rpc_client/src/meta_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 10 shared commits counted here, the most recent 3 are \u0060f2d2606b\u0060 refactor: deduplicate await-tree fetching \u0026 add registry for meta nod\u2026; \u00601611e1bf\u0060 feat(proto): introduce iceberg compaction proto (#21778); \u00605bb02eae\u0060 feat(iceberg): support iceberg jdbc catalog views (#21400) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61da77f9ed983b85ea4d06c679114971455ddb8ca235e58c26e3aa85cb6135ce"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: SinkWriterStreamObserver.java \u2194 remote.rs: \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/SinkWriterStreamObserver.java\u0060 (context java) and \u0060src/connector/src/sink/remote.rs\u0060 (context connector) sit in DIFFERENT parts of the tree yet change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 10 shared commits counted here, the most recent 3 are \u0060001ac816\u0060 fix: change JNI sink normal logs to debug level (#19758); \u0060ff495144\u0060 fix: deprecate \u0060SinkPayloadFormat\u0060 (#16723); \u0060f47a892e\u0060 feat(sink): support es sink struct and refactor es sink (#14231) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/SinkWriterStreamObserver.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddfd85fb74628f7e106fab0842a3dc72e43c453dae439b6b9fe82683c40cdb1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: risingwave-dev-dashboard.dashboard.py \u2194 compactor_metrics.rs: \u0060grafana/risingwave-dev-dashboard.dashboard.py\u0060 (context grafana) and \u0060src/storage/src/monitor/compactor_metrics.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 11 shared commits counted here, the most recent 3 are \u006092f70db9\u0060 feat(storage): support block_size metrics (#17660); \u0060035da38d\u0060 feat(storage): Improve task measurement on the compactor side with pa\u2026; \u00603e976cc3\u0060 chore(metric): fix table id filter and some panel reorgs (#12148) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"grafana/risingwave-dev-dashboard.dashboard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6128c34c8278efe239b7d5d9fa613a9b11ce8eefdc021c55c4f0dc4ef78a0e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: builtin_scalar.rs \u2194 pure.rs: \u0060src/frontend/src/binder/expr/function/builtin_scalar.rs\u0060 (context binder) and \u0060src/frontend/src/expr/pure.rs\u0060 (context expr) sit in DIFFERENT parts of the tree yet change together 78% of the time (28 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00606e8b2689\u0060 feat(expr): support volatile timestamp and uuid functions (#26362); \u00604339a18e\u0060 feat(expr): support array overlap predicates (#25597); \u006055bf4572\u0060 feat(expr): implement crc32 and crc32c bytea functions (#24964) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/function/builtin_scalar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47051a8a7337e135eb7e3183b878d2131bb04bdaf131b6c0a8338ef191c40423"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: builtin_scalar.rs \u2194 strong.rs: \u0060src/frontend/src/binder/expr/function/builtin_scalar.rs\u0060 (context binder) and \u0060src/frontend/src/optimizer/plan_expr_visitor/strong.rs\u0060 (context optimizer) sit in DIFFERENT parts of the tree yet change together 78% of the time (28 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00606e8b2689\u0060 feat(expr): support volatile timestamp and uuid functions (#26362); \u00604339a18e\u0060 feat(expr): support array overlap predicates (#25597); \u006055bf4572\u0060 feat(expr): implement crc32 and crc32c bytea functions (#24964) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/function/builtin_scalar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffbfe867a47a125fb16a115366ec67a0434deaf50382707014e31b064c339ef"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: Binding.java \u2194 macros.rs: \u0060java/java-binding/src/main/java/com/risingwave/java/binding/Binding.java\u0060 (context java) and \u0060src/jni_core/src/macros.rs\u0060 (context jni_core) sit in DIFFERENT parts of the tree yet change together 78% of the time (14 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 14 shared commits counted here, the most recent 3 are \u0060aace224a\u0060 fix(cdc): share type compatibility validation for schema changes (#26\u2026; \u0060d21c9335\u0060 fix(mysql-cdc): introduce \u0060OpendalSchemaHistory\u0060 to resolve the schem\u2026; \u006054711c25\u0060 refactor(connector): \u200Acorrectly log java exceptions (#20840) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/java-binding/src/main/java/com/risingwave/java/binding/Binding.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f64af7ca2f551e2b7905d1633d90beb190af7e84eb60e7c7ac3697d2514559"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: catalog_service.rs \u2194 ddl_controller.rs: \u0060src/frontend/src/catalog/catalog_service.rs\u0060 (context catalog) and \u0060src/meta/src/rpc/ddl_controller.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 77% of the time (36 of the 47 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 36 shared commits counted here, the most recent 3 are \u0060b927f6c8\u0060 feat(ddl): support resource group alter for databases, sinks and inde\u2026; \u0060fa7a8840\u0060 feat(meta): support wait jobs (#25133); \u0060b5e216c4\u0060 feat: enable clippy lints for stack overflow detection \u0026 fix warnings\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/catalog_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f48424d39fd3a72490558da9a69b6870137c42332123ef1df837cbaa576df3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: opts.rs \u2194 state_table.rs: \u0060src/storage/hummock_trace/src/opts.rs\u0060 (context storage) and \u0060src/stream/src/common/table/state_table.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 12 shared commits counted here, the most recent 3 are \u0060f6628e44\u0060 feat(observability): add fragment-level immutable memtable memory met\u2026; \u006011222b5d\u0060 feat(storage): support state clean for watermark in either pk or valu\u2026; \u0060053e1e61\u0060 feat(storage): batch add flushed imm to uploader (#22342) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_trace/src/opts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bfc6746fbefa9ce570a67f2320a00536f7fecbe8be2fa85a54da0644058bb3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rw_fragments.rs \u2194 stream_service.rs: \u0060src/frontend/src/catalog/system_catalog/rw_catalog/rw_fragments.rs\u0060 (context catalog) and \u0060src/meta/service/src/stream_service.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u0060914f962d\u0060 perf: avoid fetching stream nodes in system catalogs (#24641); \u00603512bee3\u0060 feat: expose parallelism_policy in fragment metadata and system catal\u2026; \u0060aa180c40\u0060 feat(meta): let stream actors in fragment share same stream node (#20\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/system_catalog/rw_catalog/rw_fragments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bcdb1592e13f07669307c4cdcfed665df48d1a96eec9f51799b35117ef5c3c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: vnode_placement.rs \u2194 scale.rs: \u0060src/common/src/vnode_mapping/vnode_placement.rs\u0060 (context common) and \u0060src/meta/src/stream/scale.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u0060709894d8\u0060 fix: Fix the panic issue with the parallelism() call (#19849); \u00609bc0b1fb\u0060 feat: introduce node label (#19153); \u00608d5b62b1\u0060 feat: variable vnode count support in batch/streaming scheduler (#18407) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/vnode_mapping/vnode_placement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5606b834a7d92388b82cfcbdf898dd8a71f82e27227468b83664235dca2bf916"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_service.rs \u2194 hummock_meta_client.rs: \u0060src/meta/service/src/hummock_service.rs\u0060 (context meta) and \u0060src/rpc_client/src/hummock_meta_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 10 shared commits counted here, the most recent 3 are \u006068694f40\u0060 feat(compaction): support manual compact target level (#25765); \u006078494334\u0060 refactor(meta): improve the determinism of trigger_manual_compaction \u2026; \u00601611e1bf\u0060 feat(proto): introduce iceberg compaction proto (#21778) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/hummock_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce33ce3e6d98059192ff030b3082ef3a56f50cdd373d5fbe0676ffe6f50ca97"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: cluster_service.rs \u2194 meta_client.rs: \u0060src/meta/service/src/cluster_service.rs\u0060 (context meta) and \u0060src/rpc_client/src/meta_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 71% of the time (12 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 12 shared commits counted here, the most recent 3 are \u00604afdad11\u0060 fix(batch): mask serving workers with version mismatch (#26559); \u0060086b9030\u0060 refactor(meta): deprecate is_unschedulable for worker (#25003); \u0060200ed05c\u0060 feat(meta): add a rpc to fetch meta store endpoint (#19594) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/cluster_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb621d5cc338dc540fcecb74032409e0828976bf1b8540dbfeffb4d17c14d2ef"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: function_catalog.rs \u2194 mod.rs: \u0060src/frontend/src/catalog/function_catalog.rs\u0060 (context catalog) and \u0060src/meta/src/controller/mod.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00604dd038f1\u0060 chore(function): expose created_at and created_at_cluster_version for\u2026; \u00600cc54b3f\u0060 feat(udf): introduce async and batched JavaScript UDF (#20403); \u006094154c03\u0060 refactor(udf): remove \u0060function_type\u0060 field previously used by Deno U\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/function_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6d37fae66df247aa1f0f2b70d5992c6a7f8b287edbe2feea49a2d10ff41789"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 parser.rs: \u0060src/frontend/src/handler/mod.rs\u0060 (context handler) and \u0060src/sqlparser/src/parser.rs\u0060 (context sqlparser) sit in DIFFERENT parts of the tree yet change together 68% of the time (83 of the 122 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 83 shared commits counted here, the most recent 3 are \u00607897e558\u0060 feat(storage): support runtime file cache clearing (#26577); \u0060013bc9c9\u0060 feat(meta): support typed fragment rate limits (#26183); \u0060b927f6c8\u0060 feat(ddl): support resource group alter for databases, sinks and inde\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1893a29794ce280f4ad501cfd1f0ae2e9d8a4421e6218e4cf42bb6d9252bf8d4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_service.rs \u2194 hummock_meta_client.rs: \u0060src/meta/service/src/hummock_service.rs\u0060 (context meta) and \u0060src/storage/src/hummock/hummock_meta_client.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 67% of the time (10 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 10 shared commits counted here, the most recent 3 are \u006068694f40\u0060 feat(compaction): support manual compact target level (#25765); \u006078494334\u0060 refactor(meta): improve the determinism of trigger_manual_compaction \u2026; \u00601611e1bf\u0060 feat(proto): introduce iceberg compaction proto (#21778) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/hummock_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ce621d915b0c8b4b5dfdbc3b027d0da69fceed1437eebd27a94ee09c8fa724"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_streaming_rate_limit.rs \u2194 parser.rs: \u0060src/frontend/src/handler/alter_streaming_rate_limit.rs\u0060 (context handler) and \u0060src/sqlparser/src/parser.rs\u0060 (context sqlparser) sit in DIFFERENT parts of the tree yet change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u006091a0a91c\u0060 feat(frontend): support sink backfill rate limit (#24075); \u00609cc5d229\u0060 feat(frontend,meta): support alter fragment rate limit (#20795); \u006068c38d7b\u0060 revert:feat(frontend): support alter source pause/resume (#19636) (#2\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_streaming_rate_limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af98fbde9f8555381a885cf4e3347949473001c584310d947f1a866a5cfc65e4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_streaming_rate_limit.rs \u2194 ddl.rs: \u0060src/frontend/src/handler/alter_streaming_rate_limit.rs\u0060 (context handler) and \u0060src/sqlparser/src/ast/ddl.rs\u0060 (context sqlparser) sit in DIFFERENT parts of the tree yet change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u006091a0a91c\u0060 feat(frontend): support sink backfill rate limit (#24075); \u00609cc5d229\u0060 feat(frontend,meta): support alter fragment rate limit (#20795); \u006068c38d7b\u0060 revert:feat(frontend): support alter source pause/resume (#19636) (#2\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_streaming_rate_limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2d7b51048dee587820c4d361e862749215ab890ace69abd271fd304d2104d4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: SinkWriterStreamObserver.java \u2194 connector_client.rs: \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/SinkWriterStreamObserver.java\u0060 (context java) and \u0060src/rpc_client/src/connector_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u0060ff495144\u0060 fix: deprecate \u0060SinkPayloadFormat\u0060 (#16723); \u0060f47a892e\u0060 feat(sink): support es sink struct and refactor es sink (#14231); \u006027fbce9f\u0060 refactor(sink): remove unnecessary StartEpoch of remote sink (#13806) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/SinkWriterStreamObserver.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed902ca54f6210715493981c239b614f9d8b12d04936f26f55667738387166c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: parser.rs \u2194 pg_response.rs: \u0060src/sqlparser/src/parser.rs\u0060 (context sqlparser) and \u0060src/utils/pgwire/src/pg_response.rs\u0060 (context utils) sit in DIFFERENT parts of the tree yet change together 65% of the time (17 of the 26 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 17 shared commits counted here, the most recent 3 are \u0060feb8d927\u0060 feat: support alter compaction group config via sql (#24346); \u0060fa7a8840\u0060 feat(meta): support wait jobs (#25133); \u006038175bba\u0060 feat(sql): add BACKUP and delete meta snapshot commands (#25042) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sqlparser/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a21188d975e4607aa92114e5169367b173575578749dc256c12975d382f278b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_service.rs \u2194 meta_client.rs: \u0060src/meta/service/src/hummock_service.rs\u0060 (context meta) and \u0060src/rpc_client/src/meta_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 65% of the time (24 of the 37 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 24 shared commits counted here, the most recent 3 are \u006068694f40\u0060 feat(compaction): support manual compact target level (#25765); \u006078494334\u0060 refactor(meta): improve the determinism of trigger_manual_compaction \u2026; \u00601611e1bf\u0060 feat(proto): introduce iceberg compaction proto (#21778) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/service/src/hummock_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a106e47dede47b585dbac49e6495294cdd0afd5f4e5c17b81639cb7eaafbdab9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: binary_op.rs \u2194 pure.rs: \u0060src/frontend/src/binder/expr/binary_op.rs\u0060 (context binder) and \u0060src/frontend/src/expr/pure.rs\u0060 (context expr) sit in DIFFERENT parts of the tree yet change together 64% of the time (16 of the 25 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00604339a18e\u0060 feat(expr): support array overlap predicates (#25597); \u00600444a8fc\u0060 feat(expr): \u0060vector || vector\u0060 concatenation (#22745); \u006099a1c26d\u0060 feat(expr): more \u0060vector\u0060 distance functions (#22647) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/binder/expr/binary_op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cff36f0a89952316d534ad3843856daae840b7387993d147e656bb77779ac7"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: desc.rs \u2194 create_source.rs: \u0060src/connector/src/source/reader/desc.rs\u0060 (context connector) and \u0060src/frontend/src/handler/create_source.rs\u0060 (context handler) sit in DIFFERENT parts of the tree yet change together 64% of the time (14 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 14 shared commits counted here, the most recent 3 are \u0060ba225b21\u0060 fix(planner): correctly handle hidden columns for SourceBackfill (#19\u2026; \u00608fe655f9\u0060 refactor: minor refactor on source column desc (#17417); \u00601401d56c\u0060 feat(cdc): support INCLUDE TIMESTAMP for MySQL, PG and MongoDB cdc ta\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/reader/desc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca39ed851044f6e0f668e09d9e757907a726fabbf50a1751d950ad2912e892c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 utils.rs: \u0060src/object_store/src/object/opendal_engine/mod.rs\u0060 (context object_store) and \u0060src/risedevtool/src/task/utils.rs\u0060 (context risedevtool) sit in DIFFERENT parts of the tree yet change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060ddfa85b2\u0060 feat(object store): support obs (#13844); \u006083057e5c\u0060 feat(storage): support azblob  (#8257); \u00607641b15f\u0060 feat(test): add e2e test for OpenDAL fs backend (#8528) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/object_store/src/object/opendal_engine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b7f254d82f26ea196bcb4f7f8341f8a5f6a39c379de29ca48614745f054008"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: vnode_placement.rs \u2194 meta_client.rs: \u0060src/common/src/vnode_mapping/vnode_placement.rs\u0060 (context common) and \u0060src/rpc_client/src/meta_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060086b9030\u0060 refactor(meta): deprecate is_unschedulable for worker (#25003); \u00609bc0b1fb\u0060 feat: introduce node label (#19153); \u00603c18089c\u0060 chore: deprecate \u0060get_reschedule_plan\u0060 and clean up code (#17584) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/vnode_mapping/vnode_placement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba71bdefd10fde8e28cb4d0c00339ad5bf82c2ebe9dcd276acdd4be72960363c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: user_defined_function.rs \u2194 mod.rs: \u0060src/frontend/src/expr/user_defined_function.rs\u0060 (context expr) and \u0060src/meta/src/controller/mod.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00604dd038f1\u0060 chore(function): expose created_at and created_at_cluster_version for\u2026; \u00600cc54b3f\u0060 feat(udf): introduce async and batched JavaScript UDF (#20403); \u006094154c03\u0060 refactor(udf): remove \u0060function_type\u0060 field previously used by Deno U\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/expr/user_defined_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a3fb31f4d2c130a82f4d46421bed74c8a0cafb11323c5d694f129452db002"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_service.rs \u2194 main.rs: \u0060src/ctl/src/common/hummock_service.rs\u0060 (context ctl) and \u0060src/storage/hummock_test/src/bin/replay/main.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 63% of the time (12 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 12 shared commits counted here, the most recent 3 are \u0060cd1686d2\u0060 fix: fix sstable serde to avoid losing bloom filter (#24025); \u00606a70b106\u0060 feat(storage): support hummock FLAT index  (#21820); \u00607688ce1f\u0060 chore: bump foyer \u002B mixtrics (#22360) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/common/hummock_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"340d38dfe7803afdac08e40de68c467b1e8f319a6de1ec4b3178a890a1ee7f80"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_iterator.rs \u2194 test_utils.rs: \u0060src/java_binding/src/hummock_iterator.rs\u0060 (context java_binding) and \u0060src/storage/src/hummock/iterator/test_utils.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 10 shared commits counted here, the most recent 3 are \u0060cd1686d2\u0060 fix: fix sstable serde to avoid losing bloom filter (#24025); \u00606a70b106\u0060 feat(storage): support hummock FLAT index  (#21820); \u00607688ce1f\u0060 chore: bump foyer \u002B mixtrics (#22360) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/java_binding/src/hummock_iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba4d1e2e9e8003963181ed2cb6cb4fe4266f374a8ad3b465944c35378ee3c2e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_service.rs \u2194 test_utils.rs: \u0060src/ctl/src/common/hummock_service.rs\u0060 (context ctl) and \u0060src/storage/src/hummock/iterator/test_utils.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 10 shared commits counted here, the most recent 3 are \u0060cd1686d2\u0060 fix: fix sstable serde to avoid losing bloom filter (#24025); \u00606a70b106\u0060 feat(storage): support hummock FLAT index  (#21820); \u00607688ce1f\u0060 chore: bump foyer \u002B mixtrics (#22360) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/common/hummock_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9444a11fae31287f3ead882ee684fb8bd0dcd6ef76adb7cbbd7267ad607d3dda"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: risingwave-dev-dashboard.dashboard.py \u2194 streaming_stats.rs: \u0060grafana/risingwave-dev-dashboard.dashboard.py\u0060 (context grafana) and \u0060src/stream/src/executor/monitor/streaming_stats.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet change together 62% of the time (71 of the 114 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 71 shared commits counted here, the most recent 3 are \u00602b819a39\u0060 feat(sink): add sink throughput( mb/s) metrics  (#19587); \u0060a41866fc\u0060 feat(metrics): add internal latency of actors, MVs and sinks (#19639); \u00601ca2ea75\u0060 feat(over window): add \u0060over_window_accessed_entry_count\u0060 to metric f\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"grafana/risingwave-dev-dashboard.dashboard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f091932b1acf88d96dfa87b0a4df207b9a6b5e7cfc08ef13f5334d22c8543fa"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: compaction_group.rs \u2194 compaction_config.rs: \u0060src/ctl/src/cmd_impl/hummock/compaction_group.rs\u0060 (context ctl) and \u0060src/meta/src/hummock/compaction/compaction_config.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 62% of the time (13 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 13 shared commits counted here, the most recent 3 are \u00609a3a1d66\u0060 refactor(meta): remove vnode-aligned level size threshold (#25047); \u0060d2ecf841\u0060 feat: vnode key range info (#24176); \u0060d69b53be\u0060 feat(hummock): make block based XOR16 filter threshold configurable (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/hummock/compaction_group.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ffa00b8b9fc5837e05e628c79a4e8ad75ec7f7deae911830509554b01bf77f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: update.rs \u2194 stream_reader.rs: \u0060src/batch/executors/src/executor/update.rs\u0060 (context batch) and \u0060src/stream/src/executor/stream_reader.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u0060512e8849\u0060 feat(dml): sent dml data from the same session to a fixed worker node\u2026 (at that commit the file was still \u0060src/batch/src/executor/update.rs\u0060); \u0060d1710403\u0060 refactor(stream): dml just wait for the end message to be received (#\u2026 (at that commit the file was still \u0060src/batch/src/executor/update.rs\u0060); \u006085092884\u0060 chore(stream): make dml channel initial permits configurable (#10649) (at that commit the file was still \u0060src/batch/src/executor/update.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"321134c254a02b426496bfb51cd2f8210133dcaf1046f768f8278ba7f26b560e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: server.rs \u2194 server.rs: \u0060src/compute/src/server.rs\u0060 (context compute) and \u0060src/storage/compactor/src/server.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 61% of the time (35 of the 57 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 35 shared commits counted here, the most recent 3 are \u00609d0070cd\u0060 fix(meta): redact credentials in state store URLs (#26160); \u0060b658c43f\u0060 fix(monitor): add compression and use larger decode limit for Monitor\u2026; \u0060bebd4e31\u0060 feat: persist compactor iceberg flag across meta and diagnostics (#23\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e0a8b5c1f22c983849b0645d4ace42c2b7686e280306b5268edd7d9b55e6f5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: drop_sink.rs \u2194 ddl_controller.rs: \u0060src/frontend/src/handler/drop_sink.rs\u0060 (context handler) and \u0060src/meta/src/rpc/ddl_controller.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 9 shared commits counted here, the most recent 3 are \u0060f8414794\u0060 feat: manage all catalogs of the iceberg table in a transactional man\u2026; \u0060db6887f4\u0060 refactor(meta): deprecate incoming sinks fields in Table (#23091); \u00602d632d22\u0060 feat: support recoverable background sink into table with progress tr\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/drop_sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f003011146f9d48858641610bf8ba3f337d19919810ec099b494e55626da3073"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: risingwave-dev-dashboard.dashboard.py \u2194 lib.rs: \u0060grafana/risingwave-dev-dashboard.dashboard.py\u0060 (context grafana) and \u0060src/common/metrics/src/lib.rs\u0060 (context common) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060edb14931\u0060 refactor(metrics): remove \u0060actor_id\u0060 label from back-pressure metrics\u2026; \u00601faa045d\u0060 feat(metrics): add recent filter metrics (#17559); \u0060b11c8312\u0060 feat(metrics): expose sink error in grafana and factor error metrics \u2026 (at that commit the file was still \u0060src/common/src/metrics.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"grafana/risingwave-dev-dashboard.dashboard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0b974168213b4e415bdfba405d2a63ed1f2cab170835311e95500406949554"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: iceberg_scan.rs \u2194 batch_iceberg_scan.rs: \u0060src/batch/executors/src/executor/iceberg_scan.rs\u0060 (context batch) and \u0060src/frontend/src/optimizer/plan_node/batch_iceberg_scan.rs\u0060 (context optimizer) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00607150f0ca\u0060 refactor(connector): share iceberg source scan planning (#26174); \u0060a5bfcf0f\u0060 feat(batch): push limit into iceberg scans (#25924); \u0060de5e3365\u0060 refactor: introduce LogicalIcebergIntermediateScan to reduce iceberg \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/iceberg_scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"887aa1b6f0f87a06c72e8fd71db7fc9a0c211b7d670a439ccfe0e44ad140160b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: user_defined.rs \u2194 function_catalog.rs: \u0060src/expr/core/src/table_function/user_defined.rs\u0060 (context expr) and \u0060src/frontend/src/catalog/function_catalog.rs\u0060 (context catalog) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060fd37c992\u0060 fix: support async javascript UDTF (#24197); \u00600cc54b3f\u0060 feat(udf): introduce async and batched JavaScript UDF (#20403); \u006094154c03\u0060 refactor(udf): remove \u0060function_type\u0060 field previously used by Deno U\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/core/src/table_function/user_defined.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b73a6946ee064c71dfe4e8feed8a90d1c6185c55deb6de6a880bb37d1ff943"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: expr_udf.rs \u2194 function_catalog.rs: \u0060src/expr/core/src/expr/expr_udf.rs\u0060 (context expr) and \u0060src/frontend/src/catalog/function_catalog.rs\u0060 (context catalog) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00600cc54b3f\u0060 feat(udf): introduce async and batched JavaScript UDF (#20403); \u006094154c03\u0060 refactor(udf): remove \u0060function_type\u0060 field previously used by Deno U\u2026; \u0060e0f9c68d\u0060 feat(udf): store WASM UDF in meta store (#15269) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/core/src/expr/expr_udf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9a1d0e0771f4f48afd46b6b37f6fef0e0b4ef4869485a27110761579301e13"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: index_catalog.rs \u2194 create_index.rs: \u0060src/frontend/src/catalog/index_catalog.rs\u0060 (context catalog) and \u0060src/frontend/src/handler/create_index.rs\u0060 (context handler) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 13 shared commits counted here, the most recent 3 are \u00601c836621\u0060 feat(vector): support batch vector index lookup join (#23154); \u006063592839\u0060 feat(frontend): support create vector index on function expression (#\u2026; \u0060a422cf3f\u0060 feat(frontend): convert to read vector index on covering vector index\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/index_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5420e63e976a6d1586d5e317c9db6cf43497b03d4633d41d8d2538095ad152ab"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: dml_manager.rs \u2194 stream_reader.rs: \u0060src/dml/src/dml_manager.rs\u0060 (context dml) and \u0060src/stream/src/executor/stream_reader.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060fa9e7547\u0060 refactor(error): dedicated error type for \u0060dml\u0060 crate (#14768); \u0060512e8849\u0060 feat(dml): sent dml data from the same session to a fixed worker node\u2026 (at that commit the file was still \u0060src/source/src/dml_manager.rs\u0060); \u006085092884\u0060 chore(stream): make dml channel initial permits configurable (#10649) (at that commit the file was still \u0060src/source/src/dml_manager.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dml/src/dml_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8cbbd699e27ee5720c4b801e8f6bb4b38b889971160d07510a1b6cd78836f6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_streaming_rate_limit.rs \u2194 stream_service.rs: \u0060src/frontend/src/handler/alter_streaming_rate_limit.rs\u0060 (context handler) and \u0060src/meta/service/src/stream_service.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u006091a0a91c\u0060 feat(frontend): support sink backfill rate limit (#24075); \u00601c0bd1f7\u0060 fix(sink): fix mem log store was blocked with rate limit = 0 (#22458); \u00609cc5d229\u0060 feat(frontend,meta): support alter fragment rate limit (#20795) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_streaming_rate_limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e07b8cda965db2f692c890f5e7961b6c101b2a074d7666593b6b0b1baf41712"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_service.rs \u2194 hummock_iterator.rs: \u0060src/ctl/src/common/hummock_service.rs\u0060 (context ctl) and \u0060src/java_binding/src/hummock_iterator.rs\u0060 (context java_binding) sit in DIFFERENT parts of the tree yet change together 58% of the time (11 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 11 shared commits counted here, the most recent 3 are \u0060cd1686d2\u0060 fix: fix sstable serde to avoid losing bloom filter (#24025); \u00606a70b106\u0060 feat(storage): support hummock FLAT index  (#21820); \u00607688ce1f\u0060 chore: bump foyer \u002B mixtrics (#22360) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/common/hummock_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cba828d7112432f0032621ff5760e7e026ac24a0221212e8dc7783922201219"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hummock_iterator.rs \u2194 main.rs: \u0060src/java_binding/src/hummock_iterator.rs\u0060 (context java_binding) and \u0060src/storage/hummock_test/src/bin/replay/main.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 58% of the time (11 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 11 shared commits counted here, the most recent 3 are \u0060cd1686d2\u0060 fix: fix sstable serde to avoid losing bloom filter (#24025); \u00606a70b106\u0060 feat(storage): support hummock FLAT index  (#21820); \u00607688ce1f\u0060 chore: bump foyer \u002B mixtrics (#22360) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/java_binding/src/hummock_iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cc241a2d29c3b2a3e98de6a3f95bfeb67eba93cb60bb6a10c71a34708a953d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_parallelism.rs \u2194 ddl_controller.rs: \u0060src/frontend/src/handler/alter_parallelism.rs\u0060 (context handler) and \u0060src/meta/src/rpc/ddl_controller.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u00602e7de350\u0060 feat: add support to alter backfill parallelism for streaming jobs (#\u2026; \u0060c0d596c3\u0060 feat: add SQL support to alter fragment parallelism  (#23523); \u0060ea7c01eb\u0060 feat: support alter source set parallelism \u0026 fix shared source scale \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_parallelism.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8f30ae8192445a0541a7c0f517eb7498d068fe25a86c76d2200a79f980d0f6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 compaction_config.rs: \u0060src/ctl/src/lib.rs\u0060 (context ctl) and \u0060src/meta/src/hummock/compaction/compaction_config.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 57% of the time (13 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 13 shared commits counted here, the most recent 3 are \u00609a3a1d66\u0060 refactor(meta): remove vnode-aligned level size threshold (#25047); \u0060d2ecf841\u0060 feat: vnode key range info (#24176); \u0060d69b53be\u0060 feat(hummock): make block based XOR16 filter threshold configurable (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac5c06020505808e9e8a51606031f375df255544ff85dfe7059bb1e9ed6a9b0"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: stream_manager.rs \u2194 stream_client.rs: \u0060src/meta/src/stream/stream_manager.rs\u0060 (context meta) and \u0060src/rpc_client/src/stream_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 9 shared commits counted here, the most recent 3 are \u006096e09b44\u0060 feat(meta): do configuration change in single barrier (#20493); \u006006d5cdef\u0060 refactor: maintain subscriptions in local barrier worker (#18516); \u00607d3f2856\u0060 refactor: remove drop_actors rpc and simplify barrier worker state (#\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/stream_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88560021317e5a52e74965a13df8757da4ae1b2b4ebf3eae21744ff549ca5b4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: query.rs \u2194 datafusion_plan_converter.rs: \u0060src/frontend/src/handler/query.rs\u0060 (context handler) and \u0060src/frontend/src/optimizer/plan_visitor/datafusion_plan_converter.rs\u0060 (context optimizer) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060c0f55f16\u0060 fix: panic when DataFusionPlanConverter fails (#24766); \u0060906c0152\u0060 feat: enhance DataFusionExecuteChecker to align with DataFusionPlanCo\u2026; \u006037cddc5b\u0060 feat: support window function in datafusion (#24297) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e82d134350ef17134a1b52f60c19a4ef9c90d4334842fd8179b32dd8aeea24"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 datafusion_plan_converter.rs: \u0060src/frontend/src/datafusion/execute/mod.rs\u0060 (context datafusion) and \u0060src/frontend/src/optimizer/plan_visitor/datafusion_plan_converter.rs\u0060 (context optimizer) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060c0f55f16\u0060 fix: panic when DataFusionPlanConverter fails (#24766); \u0060549eaaa9\u0060 feat: support table functions for datafusion (#24715) (at that commit the file was still \u0060src/frontend/src/datafusion/execute.rs\u0060); \u0060906c0152\u0060 feat: enhance DataFusionExecuteChecker to align with DataFusionPlanCo\u2026 (at that commit the file was still \u0060src/frontend/src/datafusion/execute.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/datafusion/execute/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f2eda3c8c52a8a734f2fc3f3c7661f260dfd639bdc57209b8f2f71042c2368"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: confluent_resolver.rs \u2194 create_source.rs: \u0060src/connector/src/parser/avro/confluent_resolver.rs\u0060 (context connector) and \u0060src/frontend/src/handler/create_source.rs\u0060 (context handler) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00605c52c7d7\u0060 feat(source): Avro with AWS Glue Schema Registry (#17605); \u006067b5feb7\u0060 refactor(source): move schema registry to parent mod (#12986) (at that commit the file was still \u0060src/connector/src/parser/avro/schema_resolver.rs\u0060); \u006061ab2cd6\u0060 feat(source): support json schema (#11797) (at that commit the file was still \u0060src/connector/src/parser/avro/schema_resolver.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/avro/confluent_resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76deec24727f52d78f27e6a8d8542dd0d6bfb8488c2bae11e7b1d214483daa1c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: vnode_placement.rs \u2194 query.rs: \u0060src/common/src/vnode_mapping/vnode_placement.rs\u0060 (context common) and \u0060src/frontend/src/scheduler/distributed/query.rs\u0060 (context scheduler) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060086b9030\u0060 refactor(meta): deprecate is_unschedulable for worker (#25003); \u00609bc0b1fb\u0060 feat: introduce node label (#19153); \u006004cd1b51\u0060 feat: Replace the parallel unit mapping with worker slot mapping in f\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/vnode_mapping/vnode_placement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"603f4854f27dd204683668d1f13d27c51a79088fabb2bec207369a2e3ccddd27"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: stream_materialize.rs \u2194 compaction_catalog_manager.rs: \u0060src/frontend/src/optimizer/plan_node/stream_materialize.rs\u0060 (context optimizer) and \u0060src/storage/src/compaction_catalog_manager.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 54% of the time (20 of the 37 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00606becf3a5\u0060 refactor(streaming): remove \u0060cleaned_by_watermark\u0060 field in table (#2\u2026; \u0060624f65e7\u0060 refactor(watermark): use clean_watermark_indices to replace clean_wat\u2026; \u0060db6887f4\u0060 refactor(meta): deprecate incoming sinks fields in Table (#23091) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_materialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3017fb60eb7155f4ce4d38fd79d2e2e83e2c4731b0899e8ffc64c2e33f9dc2a9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: risingwave-dev-dashboard.dashboard.py \u2194 stats.rs: \u0060grafana/risingwave-dev-dashboard.dashboard.py\u0060 (context grafana) and \u0060src/batch/src/monitor/stats.rs\u0060 (context batch) 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u006052f23318\u0060 feat(iceberg): introduce read/write bytes metrics for iceberg and all\u2026; \u00605e427d6c\u0060 feat(batch): enable batch query metric by default and only collect no\u2026; \u0060b2bd5a9d\u0060 feat(metrics): add metrics for batch spilling (#17259) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"grafana/risingwave-dev-dashboard.dashboard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237ca2771984acd1a674d4640d1a3af3103c4c414f32819f0a5038b32daae140"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: update.rs \u2194 dml.rs: \u0060src/batch/executors/src/executor/update.rs\u0060 (context batch) and \u0060src/stream/src/executor/dml.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 9 shared commits counted here, the most recent 3 are \u0060512e8849\u0060 feat(dml): sent dml data from the same session to a fixed worker node\u2026 (at that commit the file was still \u0060src/batch/src/executor/update.rs\u0060); \u0060d1710403\u0060 refactor(stream): dml just wait for the end message to be received (#\u2026 (at that commit the file was still \u0060src/batch/src/executor/update.rs\u0060); \u006085092884\u0060 chore(stream): make dml channel initial permits configurable (#10649) (at that commit the file was still \u0060src/batch/src/executor/update.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd256fcb20a754d89264f7d3dfea1964e42967a5c14df88cf075be21aac37ea7"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: risingwave-dev-dashboard.dashboard.py \u2194 hummock_state_store_metrics.rs: \u0060grafana/risingwave-dev-dashboard.dashboard.py\u0060 (context grafana) and \u0060src/storage/src/monitor/hummock_state_store_metrics.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 53% of the time (19 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 19 shared commits counted here, the most recent 3 are \u00608e6ebb0c\u0060 refactor: add metrics for time travel and recent versions (#18690); \u0060e9050005\u0060 refactor(storage): add metrics for uploader memory and no instance id\u2026; \u00603cb1effa\u0060 feat(metrics): add block cache efficienfy metrics to grafana (#17068) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"grafana/risingwave-dev-dashboard.dashboard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c2950c78fdd10faa1e223f08bde2ecc5b1fac0e26d6189226f53836dc5c0fc"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: storage.rs \u2194 mod.rs: \u0060src/common/src/config/storage.rs\u0060 (context common) and \u0060src/storage/src/hummock/compactor/mod.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 50% of the time (10 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 10 shared commits counted here, the most recent 3 are \u00609e05eac8\u0060 fix(iceberg): apply backpressure when pulling compaction tasks (#26838); \u00607d4c9650\u0060 feat(iceberg): add memory budget management for iceberg compaction (#\u2026; \u00603060e31b\u0060 feat(storage): add \u0060iceberg_compaction_enable_prefetch\u0060 config to red\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/config/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"548ff68bcf0d18d1ee73eec30806c9960297c94dd3180e04a1c95bfd2387655d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: stream_exchange_service.rs \u2194 mod.rs: \u0060src/compute/src/rpc/service/stream_exchange_service.rs\u0060 (context compute) and \u0060src/stream/src/task/barrier_worker/mod.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 9 shared commits counted here, the most recent 3 are \u0060d158804e\u0060 feat(observability): track channel buffered memory (#24810); \u00604e6e521b\u0060 refactor: only handle partial graphs in local barrier worker (#24239); \u00609dd6477b\u0060 fix(meta): avoid handling stale exchange request with term_id (#20879) (at that commit the files were still \u0060src/compute/src/rpc/service/exchange_service.rs\u0060 and \u0060src/stream/src/task/barrier_manager.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compute/src/rpc/service/stream_exchange_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28e8e8585d2dd98e952432d220fef848c05cfca2777f502ae2122c0e37f1d1e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rpc.rs \u2194 stream_client.rs: \u0060src/meta/src/barrier/rpc.rs\u0060 (context meta) and \u0060src/rpc_client/src/stream_client.rs\u0060 (context rpc_client) sit in DIFFERENT parts of the tree yet change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 8 shared commits counted here, the most recent 3 are \u006096e09b44\u0060 feat(meta): do configuration change in single barrier (#20493); \u0060c9206948\u0060 refactor(barrier): add control request to explicitly create partial g\u2026; \u006006d5cdef\u0060 refactor: maintain subscriptions in local barrier worker (#18516) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/rpc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"859a74debb716bec84ae53194f8be72f59ad2a137c5706b2c3a04a972a1ed627"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: stream_hash_join.rs \u2194 hash_join.rs: \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060 (context optimizer) and \u0060src/stream/src/from_proto/hash_join.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060045ceb7f\u0060 feat(streaming): improve watermark handling for hash join (#24144); \u0060f10bed8f\u0060 refactor(streaming): fix and refactor the watermark based state clean\u2026; \u0060b9afc41e\u0060 feat: migrate \u0060JoinEncodingType\u0060 from session config to per-job confi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_hash_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaa84432d9811cab729bd9e809bd9ad372a015ce3f8fc3225ee454d0c06f6f5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: cluster_info.rs \u2194 scale.rs: \u0060src/ctl/src/cmd_impl/meta/cluster_info.rs\u0060 (context ctl) and \u0060src/meta/src/stream/scale.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060a6cf21da\u0060 refactor(meta): wrap fragment type mask with struct (#22419); \u0060827ce146\u0060 refactor(meta): do not store upstream actors in merge node (#20222); \u0060c45327ba\u0060 fix(meta): locate upstream source fragment correctly for SourceBackfi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/meta/cluster_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a5b5e2e4ca88e8c8a33c3ff62920e3e3b775dbb7a33d7e5c0cebf72f62ed47"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_parallelism.rs \u2194 stream_manager.rs: \u0060src/frontend/src/handler/alter_parallelism.rs\u0060 (context handler) and \u0060src/meta/src/stream/stream_manager.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00602e7de350\u0060 feat: add support to alter backfill parallelism for streaming jobs (#\u2026; \u006082992299\u0060 feat: add reschedule support for backfilling jobs (#23998); \u0060c0d596c3\u0060 feat: add SQL support to alter fragment parallelism  (#23523) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_parallelism.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58e006df45eed76344bc764af583dcc32a6d5b19cc5465001dc79848f48e40a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_parallelism.rs \u2194 scale.rs: \u0060src/frontend/src/handler/alter_parallelism.rs\u0060 (context handler) and \u0060src/meta/src/stream/scale.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00602e7de350\u0060 feat: add support to alter backfill parallelism for streaming jobs (#\u2026; \u006082992299\u0060 feat: add reschedule support for backfilling jobs (#23998); \u0060c0d596c3\u0060 feat: add SQL support to alter fragment parallelism  (#23523) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_parallelism.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237784af3ca6e63983821e47653950bfdd840d7c7ad9a7fd23a4eff0bef690cb"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_streaming_rate_limit.rs \u2194 streaming_job.rs: \u0060src/frontend/src/handler/alter_streaming_rate_limit.rs\u0060 (context handler) and \u0060src/meta/src/controller/streaming_job.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u006091a0a91c\u0060 feat(frontend): support sink backfill rate limit (#24075); \u00601c0bd1f7\u0060 fix(sink): fix mem log store was blocked with rate limit = 0 (#22458); \u00609cc5d229\u0060 feat(frontend,meta): support alter fragment rate limit (#20795) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_streaming_rate_limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38681cdac4abca7f658d9643b1e0201773c4a962164d11648f15ef5e605f1088"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: logical_join.rs \u2194 temporal_join.rs: \u0060src/frontend/src/optimizer/plan_node/logical_join.rs\u0060 (context optimizer) and \u0060src/stream/src/from_proto/temporal_join.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060b69e37ce\u0060 feat(stream): support broadcast temporal join (#26932); \u0060d9ee9b45\u0060 feat(frontend): plan nested loop temporal join (#19201); \u0060aa9d4baa\u0060 feat(stream): support non-append-only  process time temporal join (#1\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbca5ee1398cc84a07f9d80b682142362af38fda4fa80edb1455e3ec58bb10e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: distributed_lookup_join.rs \u2194 scan.rs: \u0060src/batch/executors/src/executor/join/distributed_lookup_join.rs\u0060 (context batch) and \u0060src/ctl/src/cmd_impl/table/scan.rs\u0060 (context ctl) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060271877a5\u0060 refactor: rename StorageTable to BatchTable (#20235); \u0060670a94f1\u0060 feat: variable vnode count support in table distribution (#18373) (at that commit the file was still \u0060src/batch/src/executor/join/distributed_lookup_join.rs\u0060); \u0060846196d4\u0060 refactor: unify compute vnode logic (#14526) (at that commit the file was still \u0060src/batch/src/executor/join/distributed_lookup_join.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/executors/src/executor/join/distributed_lookup_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3fbca105cdddc380804061e4a965f2feb139f746b9d81203b4eefc09081c00"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_table_with_sr.rs \u2194 mod.rs: \u0060src/frontend/src/handler/alter_table_with_sr.rs\u0060 (context handler) and \u0060src/frontend/src/rpc/mod.rs\u0060 (context rpc) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060b5e216c4\u0060 feat: enable clippy lints for stack overflow detection \u0026 fix warnings\u2026; \u00601211b82d\u0060 refactor(frontend): defer converting into \u0060PbTable\u0060 or \u0060PbSource\u0060 unt\u2026; \u0060b7d763ac\u0060 refactor: remove \u0060col_index_mapping\u0060 when replacing table (#21685) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_table_with_sr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87b7229e64533259f2152f4e5fa4606630a191ea8aaee8a266f57802812bb14"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: DbzCdcEngineRunner.java \u2194 reader.rs: \u0060java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzCdcEngineRunner.java\u0060 (context java) and \u0060src/connector/src/source/cdc/source/reader.rs\u0060 (context connector) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u006077c80fb8\u0060 fix(cdc): pass ownership of source message sender to java thread (#20\u2026; \u00600c2c2b9d\u0060 feat(cdc): Add MongoDB CDC Source (#14966); \u00609382565d\u0060 feat: report the error causes cdc connector exit to grafana (#14611) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"java/connector-node/risingwave-connector-service/src/main/java/com/risingwave/connector/source/core/DbzCdcEngineRunner.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab649648e0dd178263128db65345c99838ef9e36dcf9089af669715b95b20a5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: main.py \u2194 mod.rs: \u0060e2e_test/iceberg/main.py\u0060 (context e2e_test) and \u0060src/connector/src/sink/iceberg/mod.rs\u0060 (context connector) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u006000150a30\u0060 fix(iceberg): fix map - arrow convert \u0026 fix sink nested types to iceb\u2026; \u0060ff862dc9\u0060 feat: decouple iceberg commit from risingwave commit (#15634); \u0060b991eb2a\u0060 fix: fix decimal type in iceberg sink (#15817) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e_test/iceberg/main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9ac84f58b940bbf313c00b1b4a57dd2ff80085761dc548e91d49fdabc8df47"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: backup_manager.rs \u2194 backup_reader.rs: \u0060src/meta/src/backup_restore/backup_manager.rs\u0060 (context meta) and \u0060src/storage/src/hummock/backup_reader.rs\u0060 (context storage) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u00604982aad1\u0060 fix(meta): fix race condition during metadata backup (#24269); \u0060a14ff374\u0060 fix(object_store): apply config in meta node (#16199); \u00606fe4a0be\u0060 refactor(common): generate more code on system params with macro (#14\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/backup_restore/backup_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcd1ef3882bf510dcefed1f7812a334fddc5bf22e8073488097cfb21062bbc9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: function_catalog.rs \u2194 mod.rs: \u0060src/frontend/src/catalog/function_catalog.rs\u0060 (context catalog) and \u0060src/sqlparser/src/ast/mod.rs\u0060 (context sqlparser) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u00600cc54b3f\u0060 feat(udf): introduce async and batched JavaScript UDF (#20403); \u006094154c03\u0060 refactor(udf): remove \u0060function_type\u0060 field previously used by Deno U\u2026; \u0060de3696ff\u0060 feat(udf): support \u0060always_retry_on_network_error\u0060 config for udf fun\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/function_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96610c89e9743c9ae97635b5e22adad2cee68a1d7f12cd590d55b599cbc9e27b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: handle_privilege.rs \u2194 utils.rs: \u0060src/frontend/src/handler/handle_privilege.rs\u0060 (context handler) and \u0060src/meta/src/controller/utils.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u00600bedf650\u0060 feat: support privilege management for connection, function and secre\u2026; \u00608d8d47d6\u0060 feat: support grant/revoke privilege on view (#20670); \u0060218e63e3\u0060 fix: fix grant and revoke privileges for internal table (#19249) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/handle_privilege.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c217eb800eadff0079030767e1a206d9f04056869bb5eecf63e55a86540fc1e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: physical_table.rs \u2194 query.rs: \u0060src/common/src/catalog/physical_table.rs\u0060 (context common) and \u0060src/frontend/src/scheduler/distributed/query.rs\u0060 (context scheduler) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u0060ff61c885\u0060 refactor: distinguish between placeholder and compat for vnode count \u2026; \u006018863e0c\u0060 refactor(frontend): replace dist_key_indices with dist_key_in_pk_indi\u2026; \u0060630685fb\u0060 feat: apply column-aware row encoding \u0026 enable schema change (#8394) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/catalog/physical_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26b1d22b0145347b9a1684709cd35784922e454459736c8d8c49d50355761ad"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_owner.rs \u2194 ddl_controller.rs: \u0060src/frontend/src/handler/alter_owner.rs\u0060 (context handler) and \u0060src/meta/src/rpc/ddl_controller.rs\u0060 (context meta) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u0060ef9d13ac\u0060 feat: support \u0060ALTER SECRET OWNER TO\u0060  (#24548); \u006023272f6c\u0060 feat: support \u0060alter function owner to\u0060 (#24554); \u00606640f412\u0060 feat: support ALTER CONNECTION OWNER TO  (#20709) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"415d06b8fc4a87bddf762c639ee0fa421b6fc4b92bd526d05a7e75aaad658ab2"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: alter_owner.rs \u2194 parser.rs: \u0060src/frontend/src/handler/alter_owner.rs\u0060 (context handler) and \u0060src/sqlparser/src/parser.rs\u0060 (context sqlparser) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u0060ef9d13ac\u0060 feat: support \u0060ALTER SECRET OWNER TO\u0060  (#24548); \u006023272f6c\u0060 feat: support \u0060alter function owner to\u0060 (#24554); \u00606640f412\u0060 feat: support ALTER CONNECTION OWNER TO  (#20709) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_owner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd75043e5cda0ef7167d217c0254f0e1d7c79dd7fe62cfe52051254846bdc46b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: list_kv.rs \u2194 state_table.rs: \u0060src/ctl/src/cmd_impl/hummock/list_kv.rs\u0060 (context ctl) and \u0060src/stream/src/common/table/state_table.rs\u0060 (context stream) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u00604d7b2dc5\u0060 fix(storage): fix incorrect min_epoch derived from MAX_EPOCH and ttl \u2026; \u006006018117\u0060 refactor(storage): refactor read options instantiation to use \u0060..Defa\u2026; \u00609df0e159\u0060 feat(storage,batch): choose a low priority fill cache policy for batc\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ctl/src/cmd_impl/hummock/list_kv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc8ef5fa1dc66522005219c6025d75c13c748c09102adf1d81d936f9398db5b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: database_catalog.rs \u2194 parser.rs: \u0060src/frontend/src/catalog/database_catalog.rs\u0060 (context catalog) and \u0060src/sqlparser/src/parser.rs\u0060 (context sqlparser) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u006021b4c33f\u0060 feat(ddl): Implement database-level barrier and checkpoint configurat\u2026; \u006003c354ec\u0060 feat: Add support for resource group in database creation (#20751); \u0060232b9312\u0060 feat: Implement \u0060ALTER DATABASE/SCHEMA xxx RENAME TO xxx\u0060 (#13713) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/database_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61672bf54eacc7643fc85a23af20c75e98f0a8134491ef82736b190813a7e27f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: database_catalog.rs \u2194 mod.rs: \u0060src/frontend/src/catalog/database_catalog.rs\u0060 (context catalog) and \u0060src/frontend/src/handler/mod.rs\u0060 (context handler) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 5 shared commits counted here, the most recent 3 are \u006021b4c33f\u0060 feat(ddl): Implement database-level barrier and checkpoint configurat\u2026; \u006003c354ec\u0060 feat: Add support for resource group in database creation (#20751); \u0060232b9312\u0060 feat: Implement \u0060ALTER DATABASE/SCHEMA xxx RENAME TO xxx\u0060 (#13713) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/catalog/database_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8307dc786b36b3b64c7e6a1a89b8ec430ba57fa098291e997816c747d28698fe"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: panic_store.rs \u2192 replay_impl.rs, hummock_storage.rs, local_hummock_storage.rs, monitored_store.rs, traced_store.rs, store_impl.rs: \u0060src/storage/src/panic_store.rs\u0060 changes together with 6 other files \u2014 \u0060src/storage/hummock_test/src/bin/replay/replay_impl.rs\u0060, \u0060src/storage/src/hummock/store/hummock_storage.rs\u0060, \u0060src/storage/src/hummock/store/local_hummock_storage.rs\u0060, \u0060src/storage/src/monitor/monitored_store.rs\u0060, \u0060src/storage/src/monitor/traced_store.rs\u0060, \u0060src/storage/src/store_impl.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":"src/storage/src/panic_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9441e251d3747a08313c0865a79bcada23506023e85d25edbe77740a361bac99"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: traced_store.rs \u2192 replay_impl.rs, local_hummock_storage.rs, monitored_store.rs: \u0060src/storage/src/monitor/traced_store.rs\u0060 changes together with 3 other files \u2014 \u0060src/storage/hummock_test/src/bin/replay/replay_impl.rs\u0060, \u0060src/storage/src/hummock/store/local_hummock_storage.rs\u0060, \u0060src/storage/src/monitor/monitored_store.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":"src/storage/src/monitor/traced_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad862dad3efad3d986f58ae3c229e36d8d09cd6912ebf415c7e2bfab40511288"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: batch_delete.rs, batch_insert.rs, batch_update.rs: 3 files \u2014 \u0060src/frontend/src/optimizer/plan_node/batch_delete.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/batch_insert.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/batch_update.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/batch_delete.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c476e7f63c0b7fbbab3cd7d8e120a14758383ac7bfc8895664ac86ee52e5e8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: compactor_service.rs, compute_node_service.rs, frontend_service.rs, meta_node_service.rs: 4 files \u2014 \u0060src/risedevtool/src/task/compactor_service.rs\u0060, \u0060src/risedevtool/src/task/compute_node_service.rs\u0060, \u0060src/risedevtool/src/task/frontend_service.rs\u0060, \u0060src/risedevtool/src/task/meta_node_service.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 6 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/task/compactor_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e039548f75864f59864821cddc07512861d7fece413a0c75f119835689633"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: simd_json_parser.rs \u2194 simd_json_parser.rs: \u0060src/connector/src/parser/debezium/simd_json_parser.rs\u0060 and \u0060src/connector/src/parser/maxwell/simd_json_parser.rs\u0060 change together 88% of the time (14 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060af8aee94\u0060 fix(mysql-cdc): up cast all unsigned int types (#23278); \u0060755c8202\u0060 feat(cdc): allow user config \u0060debezium.time.precision.mode\u0060 to handle\u2026; \u00609b5bcdc3\u0060 refactor(source): cleanup unused \u0060ParserProperties::key_encoding_conf\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/debezium/simd_json_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90166d1f5487d33086d4dd650a60597238ebd3e98ae744d65e50de83705a961"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stream_project.rs \u2194 stream_project_set.rs: \u0060src/frontend/src/optimizer/plan_node/stream_project.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_project_set.rs\u0060 change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 10 shared commits counted here, the most recent 3 are \u0060ef3e9e6e\u0060 fix(planner): reject impure expressions on retract stream on \u0060to_prot\u2026; \u0060dc3a3fc1\u0060 refactor(optimizer): some clean up for stream nodes\u0027 constructors (#1\u2026; \u006096498a4b\u0060 refactor(optimizer): unify watermark derivation and monotonicity deri\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feb0a829b84c39f1984048df04cd0b2383862c878d2cda8c63e05d8a4a8a998"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stream_hash_agg.rs \u2194 stream_simple_agg.rs: \u0060src/frontend/src/optimizer/plan_node/stream_hash_agg.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_simple_agg.rs\u0060 change together 82% of the time (14 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060ef3e9e6e\u0060 fix(planner): reject impure expressions on retract stream on \u0060to_prot\u2026; \u00603abd4da1\u0060 refactor(optimizer): introduce \u0060Upsert\u0060 stream kind \u0026 reject it in ma\u2026; \u00603ee72eb1\u0060 refactor(proto): add \u0060LATEST\u0060 const value for proto message version e\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_hash_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c569ccff91f4514f1be8aed4139b9101374f380ce0835c6e342039e8220092"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: store_impl.rs \u2192 main.rs, replay_impl.rs, test_utils.rs, test_utils.rs: \u0060src/storage/src/store_impl.rs\u0060 changes together with 4 other files \u2014 \u0060src/storage/hummock_test/src/bin/replay/main.rs\u0060, \u0060src/storage/hummock_test/src/bin/replay/replay_impl.rs\u0060, \u0060src/storage/hummock_test/src/test_utils.rs\u0060, \u0060src/storage/src/hummock/iterator/test_utils.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/store_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca89d5ea062df0e170d7940bd5646059e400e950b3f9f9a50981c4b8e3800afb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: create_sink.rs \u2194 drop_sink.rs: \u0060src/frontend/src/handler/create_sink.rs\u0060 and \u0060src/frontend/src/handler/drop_sink.rs\u0060 change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 12 shared commits counted here, the most recent 3 are \u006092b1757b\u0060 feat(frontend): improve notifications for slow DDL (CREATE TABLE and \u2026; \u0060f8414794\u0060 feat: manage all catalogs of the iceberg table in a transactional man\u2026; \u0060db6887f4\u0060 refactor(meta): deprecate incoming sinks fields in Table (#23091) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/create_sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51088a86155a6c5ee6d77790ec8f179261feb012324a06b25c7f3810f82a6a25"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stream_group_topn.rs \u2194 stream_topn.rs: \u0060src/frontend/src/optimizer/plan_node/stream_group_topn.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_topn.rs\u0060 change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006062e18582\u0060 feat(stream): forward watermarks through TopN executors (#27056); \u00603abd4da1\u0060 refactor(optimizer): introduce \u0060Upsert\u0060 stream kind \u0026 reject it in ma\u2026; \u0060a1f114c0\u0060 fix(stream topn): fix pk indices of \u0060TopN\u0060 and \u0060GroupTopN\u0060 (#12840) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_group_topn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a17a29e4f66be058250f7007e4660bb6b030aeb30501259e74ba9b59d6413f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stream_simple_agg.rs \u2194 stream_stateless_simple_agg.rs: \u0060src/frontend/src/optimizer/plan_node/stream_simple_agg.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_stateless_simple_agg.rs\u0060 change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060ef3e9e6e\u0060 fix(planner): reject impure expressions on retract stream on \u0060to_prot\u2026; \u00603abd4da1\u0060 refactor(optimizer): introduce \u0060Upsert\u0060 stream kind \u0026 reject it in ma\u2026; \u00604d629b76\u0060 fix(optimizer): let it panic when calling \u0060dist_column_indices\u0060 on \u0060S\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_simple_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe5322f3e3d68c7f9f7e800f7fbd788bba3ab53a6fd2d1f0b5aa7dfeb694ad7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stream_hash_agg.rs \u2194 stream_stateless_simple_agg.rs: \u0060src/frontend/src/optimizer/plan_node/stream_hash_agg.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_stateless_simple_agg.rs\u0060 change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060ef3e9e6e\u0060 fix(planner): reject impure expressions on retract stream on \u0060to_prot\u2026; \u00603abd4da1\u0060 refactor(optimizer): introduce \u0060Upsert\u0060 stream kind \u0026 reject it in ma\u2026; \u0060ac0bb234\u0060 fix(stream agg): fix agg backwards compatibility issue introduced by \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_hash_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6a0f4862ec142c9ea71f9e94d3eda945730125fa9cfcfac904ce2f56fbc66f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: batch_hash_join.rs \u2192 batch_lookup_join.rs, stream_delta_join.rs, stream_hash_join.rs: \u0060src/frontend/src/optimizer/plan_node/batch_hash_join.rs\u0060 changes together with 3 other files \u2014 \u0060src/frontend/src/optimizer/plan_node/batch_lookup_join.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_delta_join.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.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":"src/frontend/src/optimizer/plan_node/batch_hash_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c69e240209be9e39269aeddc66ff5fa779457cfb4bc673e6830446a424498e2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: mod.rs \u2192 Layout.tsx, streaming.ts, relation_graph.tsx: \u0060src/meta/src/dashboard/mod.rs\u0060 changes together with 3 other files \u2014 \u0060dashboard/components/Layout.tsx\u0060, \u0060dashboard/lib/api/streaming.ts\u0060, \u0060dashboard/pages/relation_graph.tsx\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":"src/meta/src/dashboard/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c842515887101171bfdf9416c24538dbfe9f7eab1b04604c402d540027fdfa08"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: kafka.rs \u2192 debezium_json.rs, kinesis.rs, nats.rs, pulsar.rs, utils.rs: \u0060src/connector/src/sink/kafka.rs\u0060 changes together with 5 other files \u2014 \u0060src/connector/src/sink/formatter/debezium_json.rs\u0060, \u0060src/connector/src/sink/kinesis.rs\u0060, \u0060src/connector/src/sink/nats.rs\u0060, \u0060src/connector/src/sink/pulsar.rs\u0060, \u0060src/connector/src/sink/utils.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":"src/connector/src/sink/kafka.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd92566836f123818bae04f713d01875947a1ad3bfb1942593b2614d5ff5e60"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: json_parser.rs \u2194 simd_json_parser.rs: \u0060src/connector/src/parser/json_parser.rs\u0060 and \u0060src/connector/src/parser/maxwell/simd_json_parser.rs\u0060 change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060af175db5\u0060 feat(source): \u0060encode json\u0060 option \u0060timestamptz.handling.mode\u0060 (#16265); \u006061ab2cd6\u0060 feat(source): support json schema (#11797); \u0060cf0940c6\u0060 refactor(connector): avoid using macro in parser (#10120) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/parser/json_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7966b6c2c6be557ebe89c4bee18f9d0560f9c59f104160f876f91a2ccb321c6c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fs_fetch.rs \u2194 trad_source.rs: \u0060src/stream/src/from_proto/source/fs_fetch.rs\u0060 and \u0060src/stream/src/from_proto/source/trad_source.rs\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 \u006021f60ba1\u0060 fix(source): complete S3/GCS FULL_RELOAD refresh (#26016); \u00603572992f\u0060 refactor: make batch posix source follow new stream plan (#23504); \u0060ff495144\u0060 fix: deprecate \u0060SinkPayloadFormat\u0060 (#16723) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/source/fs_fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae6b8fd58c04b0243706a317cd0e833422ac4386e6caaf6f93bceb82defb4e8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tests.rs \u2194 stream_manager.rs: \u0060src/stream/src/task/barrier_worker/tests.rs\u0060 and \u0060src/stream/src/task/stream_manager.rs\u0060 change together 74% of the time (14 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u00609e06d990\u0060 refactor(stream): reorg types and add docs for BarrierWorker and stuf\u2026; \u00603b3a1c5f\u0060 refactor(barrier): explicitly maintain database barrier state separat\u2026 (at that commit the file was still \u0060src/stream/src/task/barrier_manager/tests.rs\u0060); \u0060a3c6e48c\u0060 refactor: unify to subscribe mutation via barrier sender (#18255) (at that commit the file was still \u0060src/stream/src/task/barrier_manager/tests.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/task/barrier_worker/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1be105b00bb0527d6bd1ec7b5b2129f50894b491657004398c7d3bfff31c5d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: replay_impl.rs \u2194 monitored_store.rs: \u0060src/storage/hummock_test/src/bin/replay/replay_impl.rs\u0060 and \u0060src/storage/src/monitor/monitored_store.rs\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00603729ba81\u0060 refactor(storage): remove is_dirty method from state store and refine\u2026; \u006013838cae\u0060 refactor(storage): unify state store trait get method (#20175); \u0060ec899adc\u0060 refactor(storage): create new read snapshot to read for StateStore tr\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_test/src/bin/replay/replay_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9098490869aeac0090fa38421292832a0353bfca150eb67facc99df4be271614"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: expr_udf.rs \u2194 user_defined.rs: \u0060src/expr/core/src/expr/expr_udf.rs\u0060 and \u0060src/expr/core/src/table_function/user_defined.rs\u0060 change together 72% of the time (13 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00600cc54b3f\u0060 feat(udf): introduce async and batched JavaScript UDF (#20403); \u006094154c03\u0060 refactor(udf): remove \u0060function_type\u0060 field previously used by Deno U\u2026; \u0060ff02b76c\u0060 fix(udf): add \u0060embedded-python-udf\u0060 feature and fix dockerfile (#15328) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/core/src/expr/expr_udf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5d63822d6bc28b2f1c84592608fddb941e4070c0a4f066f0466bc62633b406"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: stream_hop_window.rs \u2192 stream_dynamic_filter.rs, stream_hash_agg.rs, stream_hash_join.rs, stream_project.rs, stream_project_set.rs, stream_union.rs: \u0060src/frontend/src/optimizer/plan_node/stream_hop_window.rs\u0060 changes together with 6 other files \u2014 \u0060src/frontend/src/optimizer/plan_node/stream_dynamic_filter.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_hash_agg.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_hash_join.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_project.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_project_set.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_union.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":"src/frontend/src/optimizer/plan_node/stream_hop_window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2884b8302bfca69e1c783237c182ccc492e7204f0ac604ab146730be190950ab"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: reader.rs \u2192 reader.rs, reader.rs, reader.rs: \u0060src/connector/src/source/nexmark/source/reader.rs\u0060 changes together with 3 other files \u2014 \u0060src/connector/src/source/cdc/source/reader.rs\u0060, \u0060src/connector/src/source/datagen/source/reader.rs\u0060, \u0060src/connector/src/source/kafka/source/reader.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":"src/connector/src/source/nexmark/source/reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9fa0d103d4a550e994117ded13a9c70015a512f05068f253acf5f424a4a866"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: stream_union.rs \u2192 stream_dynamic_filter.rs, stream_hash_agg.rs, stream_project.rs, stream_stateless_simple_agg.rs: \u0060src/frontend/src/optimizer/plan_node/stream_union.rs\u0060 changes together with 4 other files \u2014 \u0060src/frontend/src/optimizer/plan_node/stream_dynamic_filter.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_hash_agg.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_project.rs\u0060, \u0060src/frontend/src/optimizer/plan_node/stream_stateless_simple_agg.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb92c2d8c74df19a29d45fa0e6728119157321570a4d43024143b03fa11226c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hash_agg.rs \u2194 simple_agg.rs: \u0060src/stream/src/from_proto/hash_agg.rs\u0060 and \u0060src/stream/src/from_proto/simple_agg.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 7 shared commits counted here, the most recent 3 are \u00606f25c038\u0060 fix(hash agg): split \u0060AggGroup\u0060 inter states and outputs change build\u2026; \u006096bca4ce\u0060 refactor(streaming): clean up unnecessary \u0060metrics\u0060 field in agg exec\u2026; \u00604726cdd3\u0060 fix(stream agg): use executor schema derived by optimizer instead of \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/hash_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfd8511c9bb6f5fc178bd9bb0576acc80e62ca8be4e97867577a99398cc993a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: mod.rs \u2192 config.rs, risedev_env.rs, service_config.rs: \u0060src/risedevtool/src/task/mod.rs\u0060 changes together with 3 other files \u2014 \u0060src/risedevtool/src/config.rs\u0060, \u0060src/risedevtool/src/risedev_env.rs\u0060, \u0060src/risedevtool/src/service_config.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":"src/risedevtool/src/task/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a19451b6e28f951a13030222ce593d5fa1af6492ee9a0e1607781f20d4f642e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: scale_service.rs \u2192 recovery.rs, scale.rs, stream_manager.rs: \u0060src/meta/service/src/scale_service.rs\u0060 changes together with 3 other files \u2014 \u0060src/meta/src/barrier/context/recovery.rs\u0060, \u0060src/meta/src/stream/scale.rs\u0060, \u0060src/meta/src/stream/stream_manager.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":"src/meta/service/src/scale_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a4ffe611d39c2d0bfb85de3bd4601a83abbb93683212085e19578858def8f8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: managed_state.rs \u2194 tests.rs: \u0060src/stream/src/task/barrier_worker/managed_state.rs\u0060 and \u0060src/stream/src/task/barrier_worker/tests.rs\u0060 change together 63% of the time (12 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u006073387f59\u0060 fix(meta): fence stale exchange requests across database recovery (#2\u2026; \u00609e06d990\u0060 refactor(stream): reorg types and add docs for BarrierWorker and stuf\u2026; \u00603b3a1c5f\u0060 refactor(barrier): explicitly maintain database barrier state separat\u2026 (at that commit the files were still \u0060src/stream/src/task/barrier_manager/managed_state.rs\u0060 and \u0060src/stream/src/task/barrier_manager/tests.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/task/barrier_worker/managed_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5479cc4987c6b44049b1c08ae4d96b2b40ede809d0c913678a2b28a072ae279"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: chain.rs \u2194 values.rs: \u0060src/stream/src/executor/chain.rs\u0060 and \u0060src/stream/src/executor/values.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060438ab534\u0060 feat(ddl): Make UpstreamSinkUnion node dynamically handle upstreams (\u2026; \u00600c8b4c34\u0060 refactor(stream): store shared context in local barrier manager (#21257); \u006029d2e1ef\u0060 refactor: track progress minor refactor (#18446) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/chain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d8e3c0f3cc2c769f3dcf08de6cda3ac44a6fbf6d97447f031f49688263dff8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: FragmentGraph.tsx \u2194 relation_graph.tsx: \u0060dashboard/components/FragmentGraph.tsx\u0060 and \u0060dashboard/pages/relation_graph.tsx\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006059dccd3d\u0060 feat(dashboard): add Prometheus-based streaming stats with backpressu\u2026; \u0060ada38dc0\u0060 feat(dashboard): add throughput (rows/s) metrics (#19972); \u0060ad95d102\u0060 feat(dashboard): improve relation \u0026 fragment graph (#19872) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"111d318b1b08fe0cd7ad1d547a2f13ad02024bc515452f212f86765c56948bf8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: alter_table_with_sr.rs \u2194 create_table.rs: \u0060src/frontend/src/handler/alter_table_with_sr.rs\u0060 and \u0060src/frontend/src/handler/create_table.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 7 shared commits counted here, the most recent 3 are \u0060b5e216c4\u0060 feat: enable clippy lints for stack overflow detection \u0026 fix warnings\u2026; \u00601211b82d\u0060 refactor(frontend): defer converting into \u0060PbTable\u0060 or \u0060PbSource\u0060 unt\u2026; \u0060f0db87be\u0060 feat(frontend): use purified definition for replacing table (#20131) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_table_with_sr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d1b61fe160f4f504a585396c070907d3b7134671d64cd9d16138a45db8eaaf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: apply_agg_transpose_rule.rs \u2194 distinct_agg_rule.rs: \u0060src/frontend/src/optimizer/rule/apply_agg_transpose_rule.rs\u0060 and \u0060src/frontend/src/optimizer/rule/distinct_agg_rule.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 7 shared commits counted here, the most recent 3 are \u00606834de8b\u0060 feat(frontend): add stateless two-phase \u0060ApproxPercentile\u0060 (#17469); \u006095956671\u0060 feat: disable some two phase agg (#12185); \u0060f9025d1b\u0060 feat(frontend): support grouping sets (#10807) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/rule/apply_agg_transpose_rule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc8b08f4b027d17b3179cffe13f60a4680cd7fa05a7503a6eacb7c1a3f346da"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: alter_table_with_sr.rs \u2194 create_sink.rs: \u0060src/frontend/src/handler/alter_table_with_sr.rs\u0060 and \u0060src/frontend/src/handler/create_sink.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 7 shared commits counted here, the most recent 3 are \u0060db6887f4\u0060 refactor(meta): deprecate incoming sinks fields in Table (#23091); \u00601211b82d\u0060 refactor(frontend): defer converting into \u0060PbTable\u0060 or \u0060PbSource\u0060 unt\u2026; \u0060b7d763ac\u0060 refactor: remove \u0060col_index_mapping\u0060 when replacing table (#21685) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_table_with_sr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b10da98da9939a33d68880974def1ad7bba439f105bdb9001ffb317b1739c92"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: status.rs \u2194 rpc.rs: \u0060src/meta/src/barrier/checkpoint/independent_job/creating_job/status.rs\u0060 and \u0060src/meta/src/barrier/rpc.rs\u0060 change together 58% of the time (11 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006006415d7f\u0060 refactor(meta): unify independent job reset handling (#26806); \u006096134b19\u0060 refactor(meta): extract independent ckpt job enum (#25249); \u00605a4cfd61\u0060 fix(snapshot-backfill): fix snapshot backfill recovery panic (#24245) (at that commit the file was still \u0060src/meta/src/barrier/checkpoint/creating_job/status.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/independent_job/creating_job/status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cafd54225bf4967bf30b19ccf5ce5a1d6005e537a772faf650847caa3d736c5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: config.rs \u2194 risedev_env.rs: \u0060src/risedevtool/src/config.rs\u0060 and \u0060src/risedevtool/src/risedev_env.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00607e5b5f5f\u0060 feat(risedev): support Docker-backed clickhouse sink tests (#26653); \u0060f6d53aeb\u0060 test(iceberg): add Glue catalog e2e coverage (#26167); \u00608248ed52\u0060 feat(risedev): add local search and document backends (#25434) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/risedevtool/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fbe5a128052c64e2f32b297ec96654964453a9aa40bf8b195c7c5c258e8108"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stage.rs \u2194 local.rs: \u0060src/frontend/src/scheduler/distributed/stage.rs\u0060 and \u0060src/frontend/src/scheduler/local.rs\u0060 change together 57% of the time (26 of the 46 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 26 shared commits counted here, the most recent 3 are \u00607eda10ef\u0060 fix(batch): cap masked fragment mapping parallelism (#26560); \u0060ee473f1a\u0060 refactor(frontend): per convention PlanNodeType enum (#22792); \u0060ba76431f\u0060 feat(batch): add \u0060batch_expr_strict_mode\u0060 to ignore expression error \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/distributed/stage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dd8865894f3958317fbd4309b83c27c89490885362a4279b90ba44d2c03969"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: opts.rs \u2194 local_hummock_storage.rs: \u0060src/storage/hummock_trace/src/opts.rs\u0060 and \u0060src/storage/src/hummock/store/local_hummock_storage.rs\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060f6628e44\u0060 feat(observability): add fragment-level immutable memtable memory met\u2026; \u0060053e1e61\u0060 feat(storage): batch add flushed imm to uploader (#22342); \u00603a244ecd\u0060 feat: ensure each storage read only involves one vnode (#15289) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/hummock_trace/src/opts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb18fdc335c18a82e65000bd11523d3f579576a6ff78b263d56ad099a311ee1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: test_utils.rs \u2194 opts.rs: \u0060src/storage/src/hummock/iterator/test_utils.rs\u0060 and \u0060src/storage/src/opts.rs\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060cd1686d2\u0060 fix: fix sstable serde to avoid losing bloom filter (#24025); \u00606a70b106\u0060 feat(storage): support hummock FLAT index  (#21820); \u00607fa1dfff\u0060 refactor(cache): upgrade foyer to 0.12 and related deps (#18822) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/hummock/iterator/test_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"042b764f218e587d1de722cb2d255951259edcc5377f34d2e5e51449b60d107b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cast.rs \u2194 literal.rs: \u0060src/expr/impl/src/scalar/cast.rs\u0060 and \u0060src/frontend/src/expr/literal.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060deff9bee\u0060 feat(common): support input/output of new data type \u0060vector(n)\u0060 (#22019); \u0060e1de1857\u0060 feat: support \u0060map_access\u0060 (#17986); \u0060cd710527\u0060 fix(binder): distinguish \u0060\u0027a\u0027::varchar\u0060 from untyped \u0060\u0027a\u0027\u0060 (#10140) (at that commit the file was still \u0060src/expr/src/vector_op/cast.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr/impl/src/scalar/cast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8447a6b3f32e85cf632ed5616ec654476bd7266a1ce64c1e475ce64b283750"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 scale.rs: \u0060src/meta/src/serving/mod.rs\u0060 and \u0060src/meta/src/stream/scale.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060982e0bc9\u0060 refactor: modify several functions to use \u0060shared_actor_info\u0060 (#23396); \u0060d0240762\u0060 fix: make batch scan adhere to runtime param batch_parallelism (#21886); \u00608d5b62b1\u0060 feat: variable vnode count support in batch/streaming scheduler (#18407) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/serving/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b95475f90d578364a3242279c7fe721aa6b6dd66bc2d031abcea3abf0354acd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: server.rs \u2194 utils.rs: \u0060src/meta/node/src/server.rs\u0060 and \u0060src/meta/src/backup_restore/utils.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00609b26a969\u0060 refactor(meta): extract code for connecting sql meta store (#19603); \u0060200ed05c\u0060 feat(meta): add a rpc to fetch meta store endpoint (#19594); \u006065ed113a\u0060 feat: expose connection options for sql meta store (#19040) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/node/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22220e2fb0ed394e1d7a811cd3845e3fe74a84c06dd50ef8c129788e9f48e188"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: alter_source_column.rs \u2194 alter_source_with_sr.rs: \u0060src/frontend/src/handler/alter_source_column.rs\u0060 and \u0060src/frontend/src/handler/alter_source_with_sr.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 \u0060b7d763ac\u0060 refactor: remove \u0060col_index_mapping\u0060 when replacing table (#21685); \u006004a8813a\u0060 refactor(frontend): use purified definition for altering source (#20182); \u00603c57ef8d\u0060 feat: enable shared source in session variable by default, and add cl\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/handler/alter_source_column.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b25d6775264ca234647862f0f392d3ce1a723b8260deae2162b465a9506879"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: no_shuffle_backfill.rs \u2194 chain.rs: \u0060src/stream/src/executor/backfill/no_shuffle_backfill.rs\u0060 and \u0060src/stream/src/executor/chain.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006029d2e1ef\u0060 refactor: track progress minor refactor (#18446); \u00602fb78f03\u0060 feat: support inject and collect barrier from partial graph (#17758); \u006022dc384c\u0060 refactor: use \u0060ExecutorParams::info\u0060 in stream scan executors (#13347) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/backfill/no_shuffle_backfill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e14913112df973b9047c971f266302791965079124008a03a3109e7bb79822"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: control.rs \u2194 mod.rs: \u0060src/meta/src/barrier/checkpoint/control.rs\u0060 and \u0060src/meta/src/barrier/context/mod.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060f8c59cff\u0060 refactor(meta): unify independent job actor rendering (#26979); \u006073387f59\u0060 fix(meta): fence stale exchange requests across database recovery (#2\u2026; \u00605655415b\u0060 feat(meta): support periodic refresh run for batch refresh job (#25271) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e5f5f92266b415420561388ef2f525ca712fb53a32a4035f1984d371cc1f5c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: enumerator.rs \u2194 reader.rs: \u0060src/connector/src/source/kafka/enumerator.rs\u0060 and \u0060src/connector/src/source/kafka/source/reader.rs\u0060 change together 53% of the time (18 of the 34 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u006089b778e5\u0060 feat: add ENV to control Kafka sdk log level (#21865); \u006006958319\u0060 feat: delete Kafka consumer group when source backfill is finished (#\u2026; \u0060bb90e0fe\u0060 feat: delete Kafka consumer group on drop (#20065) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/source/kafka/enumerator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a22c2b132b03316eef3f3e842af12b818ab4261276d131ec2ac2fac5f1d7ab"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: kinesis.rs \u2194 pulsar.rs: \u0060src/connector/src/sink/kinesis.rs\u0060 and \u0060src/connector/src/sink/pulsar.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00605c24685b\u0060 feat(sink): enable sink_decouple by default for kafka, pulsar, kinesi\u2026; \u00606635712a\u0060 refactor: move connector common to a dedicated dir (#15987); \u00603368bce8\u0060 refactor(frontend): refine decouple config (#15939) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/kinesis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"477d743e120dc22ab1c05e0c52f38d084d6561cd6a32c5c009056252457d1639"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: control.rs \u2194 status.rs: \u0060src/meta/src/barrier/checkpoint/control.rs\u0060 and \u0060src/meta/src/barrier/checkpoint/independent_job/creating_job/status.rs\u0060 change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006006415d7f\u0060 refactor(meta): unify independent job reset handling (#26806); \u006055438cf2\u0060 fix(meta): limit pending barriers in partial graphs (#26467); \u006096134b19\u0060 refactor(meta): extract independent ckpt job enum (#25249) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/barrier/checkpoint/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4947a9b58507d6e40c3fd8858c853742ba8f2ad9b729678053a6abad76bcdc5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stream_delta_join.rs \u2194 stream_temporal_join.rs: \u0060src/frontend/src/optimizer/plan_node/stream_delta_join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_temporal_join.rs\u0060 change together 52% of the time (12 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00609d51bf04\u0060 fix(optimizer): preserve eq key during rewrite in physical join plan \u2026; \u0060ef3e9e6e\u0060 fix(planner): reject impure expressions on retract stream on \u0060to_prot\u2026; \u00603abd4da1\u0060 refactor(optimizer): introduce \u0060Upsert\u0060 stream kind \u0026 reject it in ma\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_delta_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"413e7c6982d588692286a9ec722142f3aeeb33598b255d873f4715e23aa886a1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: logical_join.rs \u2194 stream_delta_join.rs: \u0060src/frontend/src/optimizer/plan_node/logical_join.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_delta_join.rs\u0060 change together 52% of the time (12 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00609d51bf04\u0060 fix(optimizer): preserve eq key during rewrite in physical join plan \u2026; \u00603abd4da1\u0060 refactor(optimizer): introduce \u0060Upsert\u0060 stream kind \u0026 reject it in ma\u2026; \u0060e82932f4\u0060 feat(streaming): plan asof join (#18683) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc77e0991df71b4333487e9f70a0af36bdec3236b91d3dab070d2af351e22ad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: input.rs \u2194 mod.rs: \u0060src/stream/src/executor/exchange/input.rs\u0060 and \u0060src/stream/src/task/barrier_worker/mod.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060d158804e\u0060 feat(observability): track channel buffered memory (#24810); \u00604e6e521b\u0060 refactor: only handle partial graphs in local barrier worker (#24239); \u0060f5f7eeb4\u0060 feat(stream): actor create exchange via channel (#21299) (at that commit the file was still \u0060src/stream/src/task/barrier_manager.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/exchange/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67270a10e2d3befd7d0e33f05710531de26f8c565bb1fc578de3271dac554c16"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: state_table.rs \u2194 sort.rs: \u0060src/stream/src/common/table/state_table.rs\u0060 and \u0060src/stream/src/executor/eowc/sort.rs\u0060 change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00608641a0c6\u0060 fix(streaming): some executors should always clear the cache on scali\u2026; \u00600ab6a4a8\u0060 feat(storage): wait committed epoch when update vnode bitmap (#20492) (at that commit the file was still \u0060src/stream/src/executor/sort.rs\u0060); \u006024336eb9\u0060 refactor(state table): replace \u0060new_\u0060 series with \u0060gen_\u0060 series (#18566) (at that commit the file was still \u0060src/stream/src/executor/sort.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/table/state_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8910a62ec91b67e04bb4b4396d8311d11a9ce5160e99c1e8abccd8da7b8726f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: logical_over_window.rs \u2194 over_window_to_topn_rule.rs: \u0060src/frontend/src/optimizer/plan_node/logical_over_window.rs\u0060 and \u0060src/frontend/src/optimizer/rule/over_window_to_topn_rule.rs\u0060 change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060b0dad757\u0060 perf(over window): skip remaining affected rows when rank is not chan\u2026; \u0060c1113400\u0060 fix(over window): fix over window predicate pushdown (#13662); \u00608ab2f266\u0060 feat(over window): support general \u0060rank\u0060 and \u0060dense_rank\u0060 window fun\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/logical_over_window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3edc164a526ce9960c6a183b41107605ad06b538cae2497a17b8504cd443a0f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: to_binary.rs \u2194 mod.rs: \u0060src/common/src/types/to_binary.rs\u0060 and \u0060src/common/src/util/value_encoding/mod.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060fa879a18\u0060 refactor(types): follow-ups of using \u0060ListType\u0060 for \u0060DataType::List\u0060 \u2026; \u0060ee8fcb4b\u0060 feat(vector): implement dedicated array and serde format for vector d\u2026; \u0060a63807d8\u0060 chore: remove Uint256 functionality and related code (#9073) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/src/types/to_binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b133f14565e6d17b8b3e2f68aaf92423e30c0434c6446734ccd685e7b2e1a657"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: stream_share.rs \u2194 stream_table_scan.rs: \u0060src/frontend/src/optimizer/plan_node/stream_share.rs\u0060 and \u0060src/frontend/src/optimizer/plan_node/stream_table_scan.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 7 shared commits counted here, the most recent 3 are \u006033da7e3c\u0060 refactor: strong typed executor and operator id (#24204); \u00608b0bde4b\u0060 refactor(proto): change \u0060bool append_only\u0060 to \u0060enum StreamKind\u0060 in st\u2026; \u0060abfee42b\u0060 fix(frontend): avoid panic when querying log store internal table (#1\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/optimizer/plan_node/stream_share.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eb7af904cde3a74b901e20d6e8c9c58319179a4fec1a11fd8061580d7bdd86"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: in_mem.rs \u2194 reader.rs: \u0060src/stream/src/common/log_store_impl/in_mem.rs\u0060 and \u0060src/stream/src/common/log_store_impl/kv_log_store/reader.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060db881a87\u0060 refactor(sink): merge log store barrier and update_vnode_bitmap item \u2026; \u00604030ddc0\u0060 feat(sink): add metrics to monitor sink back pressure (#16593); \u0060cd372beb\u0060 feat(sink): rewind log reader to isolate sink err (#14029) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/common/log_store_impl/in_mem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a622662898ece903203a7e01accfeefd6886f3526637f24c9b91cf2176f8ffd3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dispatch.rs \u2194 merge.rs: \u0060src/stream/src/executor/dispatch.rs\u0060 and \u0060src/stream/src/from_proto/merge.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00608612210e\u0060 feat(streaming): use actor-local config for exchange (#24036); \u0060f5f7eeb4\u0060 feat(stream): actor create exchange via channel (#21299); \u00600c8b4c34\u0060 refactor(stream): store shared context in local barrier manager (#21257) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98592428a427d8ab007eba88637851dadcbe8cd40788f31b993805f8b527bb01"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: merge.rs \u2194 stream_manager.rs: \u0060src/stream/src/from_proto/merge.rs\u0060 and \u0060src/stream/src/task/stream_manager.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060f5f7eeb4\u0060 feat(stream): actor create exchange via channel (#21299); \u00600c8b4c34\u0060 refactor(stream): store shared context in local barrier manager (#21257); \u0060827ce146\u0060 refactor(meta): do not store upstream actors in merge node (#20222) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/from_proto/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75fbe7d69eec9a501fdf7d16a2b12ff745753fe670ebfd4a3fad975395822bf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hash_join.rs \u2194 tests.rs: \u0060src/stream/src/executor/hash_join.rs\u0060 and \u0060src/stream/src/executor/lookup/tests.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00608b0bde4b\u0060 refactor(proto): change \u0060bool append_only\u0060 to \u0060enum StreamKind\u0060 in st\u2026; \u0060b9a1d216\u0060 feat(stream): add executor id to \u0060ExecutorInfo\u0060 (#21165); \u00603997e268\u0060 refactor: use \u0060ExecutorParams::info\u0060 in join related executors (#13389) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stream/src/executor/hash_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b27ca06073c8ebe7f39dadea502f5657ea6c187c14f994482a524941bc82bc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: debezium_json.rs \u2194 nats.rs: \u0060src/connector/src/sink/formatter/debezium_json.rs\u0060 and \u0060src/connector/src/sink/nats.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006030fd4d8a\u0060 feat(sink): support encode jsonb data as dynamic json type in sink (#\u2026; \u0060f47a892e\u0060 feat(sink): support es sink struct and refactor es sink (#14231); \u0060ec9d8ea3\u0060 fix(Sink): add \u0060name\u0060 field and change \u0060date\u0060 representation to Epoch\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connector/src/sink/formatter/debezium_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c494dfa16d3daeadb9d7f6a51438956d99af74179c46b12467216fc3c13f16"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fragment_graph.tsx \u2194 prometheus.rs: \u0060dashboard/pages/fragment_graph.tsx\u0060 and \u0060src/meta/src/dashboard/prometheus.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 \u0060ada38dc0\u0060 feat(dashboard): add throughput (rows/s) metrics (#19972); \u0060edb14931\u0060 refactor(metrics): remove \u0060actor_id\u0060 label from back-pressure metrics\u2026; \u0060e8513d4f\u0060 fix(dashboard): fix back-pressure dashboard \u0026 some refactorings (#15389) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba5dd997f156d265d2e3fbfe77c6b4e8d8b0437f05c9133a16baee71797f93b"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"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"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"}},{"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":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"}},{"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"}},{"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":"35f64a0396611dfd8e0191313b0d7cdc759890497b52affaaa727cf6ce876cfd"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id / name, and nothing it renders carries one either. The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. 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":"dashboard/pages/await_tree.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1439e666bba117c36944fc6d152e6c8b80e86c293351e49d86b5bf2616ece0"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CNumberInput\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id / name \u2014 and neither does anything it renders \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":"dashboard/pages/cpu_profiling.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa0e9eda67dfaa799f7c4c0a68f63df074404aa9e975bf180a6225e3ef83e0f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id / name, and nothing it renders carries one either. The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. 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":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01c0d93efa35cda3bd1a56983b065f68f3c6f041db07f082cfc502864edc8b9"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 24 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: BatchManagerMetrics: \u0060BatchManagerMetrics\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/src/monitor/stats.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"41271003cca50b9884d645f87d64006777d3a59d179621692d98705c9c59e516"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: BatchSpillMetrics: \u0060BatchSpillMetrics\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch/src/monitor/stats.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b5d1f8793c7cec05c5f0b46addf335d2d89aa91b5c7bc90d12a87eab6d1fe8"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: DistributedQueryMetrics: \u0060DistributedQueryMetrics\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frontend/src/scheduler/distributed/stats.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4019641df96217d3073b272ac77d2b052c9650062139b73a341400c6053d87a"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: RefreshCycleActors: \u0060RefreshCycleActors\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/meta/src/stream/refresh_manager.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceed820ef1191548bdda7868f8dc4b9495f6f7abbd71efdd489b7cd420bb9ee"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: HummockStateStoreMetrics: \u0060HummockStateStoreMetrics\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/storage/src/monitor/hummock_state_store_metrics.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01d73e62e7ef2c3918ca078d5675bf789bb04722f1b60f5339ab366b7aa26c5"}},{"ruleId":"DM7","level":"warning","message":{"text":"Repository for a non-root entity: SpringTestRepository \u2192 SpringTest: \u0060SpringTestRepository\u0060 is a repository over \u0060SpringTest\u0060, which is an entity but not an aggregate root. Repositories should be per aggregate ROOT \u2014 loading/saving a child entity independently lets callers bypass the root\u0027s invariants. Access \u0060SpringTest\u0060 through its owning aggregate instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/client-library/spring-boot/src/main/java/com/risingwave/SpringTestRepository.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c30a15ff25c8f693c10bea65ad371a112b0a9bc51cdd422dd370da49d989ded"}},{"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 55/80 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060.\u0060, \u0060dashboard\u0060, \u0060develop/sql_bench\u0060, \u0060e2e_test/iceberg\u0060 and 20 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"warning","message":{"text":"SAST runs, but gates no merge: \u0060audit.yml\u0060 run(s) a static-analysis scan, but no workflow that runs one is triggered by a pull request (or a merge queue, or an unfiltered push) \u2014 the scan fires on a schedule or a manual dispatch only. A vulnerable change therefore merges clean and is reported on the next scheduled run, by which time it is on the default branch and the only remedy is a follow-up fix. Add the pull-request trigger to the workflow that runs the scan so the finding arrives before the merge rather than after it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73211886541038635ced0208da9cedd27ed1caa9132fd6aa5e44d2976a4de6d6"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout. 14 of the 19 files that make outbound calls are unbounded; the first 10 are listed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/lib/api/api.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69d00d3d46d35567bf334f036bb85583e793bffbb4c575959d19e60e4d462c2"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060RestClient.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":"java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/ElasticRestHighLevelClientAdapter.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf2d90fe9d621b99663b9f69e8e2209769891f47418a3254895bd537adf4685"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060RestClient.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":"java/connector-node/risingwave-sink-es-7/src/main/java/com/risingwave/connector/OpensearchRestHighLevelClientAdapter.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca079e7b02fa35bb22cc469513dde019d702d7d95991e168b321493b17a96a95"}},{"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":"src/common/secret/src/vault_client.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17c3b784766a8320f39418928fd446310bfd7f9a536d1987b3a356db54ea6b3"}},{"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":"src/common/src/telemetry/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd4a31e2ef31f8e97585d3130f2c08f48dbdc213f5e78a2e96888f3e9bee7ae"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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":"src/common/telemetry_event/src/util.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0cdfae672ba00b063f88de5818e114d37a1ddf23821b58ce87474ba2e68e40"}},{"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":"src/connector/codec/src/decoder/json/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44103828e47002cd8834d2894333c6344feb09ef1af67ba6bc7e6cde4cd9a26"}},{"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":"src/connector/src/parser/utils.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ae5837962e9d440b8f89ae19e2b0453c93dc2755951b86a322cb9036e058f4"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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":"src/connector/src/sink/doris.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"21edf77a948f9f5fc183c39aac7036536f117538299c8bb267f64dbc02408cf1"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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":"src/connector/src/sink/http.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f513deec451075f19f36f16ecffce50be5d9ad08f45124f1e5ba5903abbe5a33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (105 matched lines \u00D7 2 locations): dashboard/pages/cpu_profiling.tsx:41 \u00B7 dashboard/pages/heap_profiling.tsx:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 621 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":"dashboard/pages/cpu_profiling.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"105be5209a835f9029df3c6b13c4c357477fe1b3b6938dcd7b75b52d785a89b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (76 matched lines \u00D7 2 locations): dashboard/pages/fragment_graph.tsx:337 \u00B7 dashboard/pages/relation_graph.tsx:93 \u2014 the two spans are one implementation copied and then locally edited \u2014 329 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":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e91990b4671da3813cf1d1d6945638831d7a91131d823360160fd70ee5b03e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): dashboard/pages/await_tree.tsx:133 \u00B7 dashboard/pages/heap_profiling.tsx:277 \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":"dashboard/pages/await_tree.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dbc8e715f129b6d6d7e8d4160866a61cdf2d469d2474dc7fcb2de9e77d1da7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): dashboard/components/FragmentGraph.tsx:529 \u00B7 dashboard/components/RelationGraph.tsx:221 \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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f63da67eff1b0ba6f31fb94caa213463df1c8cbceb259156649d26f32147995"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4 locations): dashboard/components/FragmentGraph.tsx:328 \u00B7 dashboard/components/FragmentGraph.tsx:533 \u00B7 dashboard/components/RelationGraph.tsx:223 \u00B7 dashboard/components/RelationGraph.tsx:380 \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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"772bf077200c3f835198c668f9581b998b04f97a82a9f5de0f1007daef8f9a10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): dashboard/lib/api/streamingStats.ts:83 \u00B7 dashboard/lib/api/streamingStats.ts: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":"dashboard/lib/api/streamingStats.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d200d9396e1afbbaf3bdd9e6932b42cb01e26b7a25996def20d25ea8ea940c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): dashboard/components/utils/stroke-icons.tsx:124 \u00B7 dashboard/components/utils/stroke-icons.tsx:233 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/components/utils/stroke-icons.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b96a697bdac974385e5e90d318c9519e1db553afcf1ebe2f2709fe9a6ed91a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): dashboard/pages/cluster.tsx:293 \u00B7 dashboard/pages/cluster.tsx:309 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/pages/cluster.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7c1c1bc39335e1bae52cdff1e968548346c7b6b2d0293eb50c64d0a2f032ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): dashboard/lib/algo.ts:31 \u00B7 dashboard/lib/algo.ts:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/lib/algo.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5855c6d3600157646382c13bb15e68d1599b501b7bb170f18790c2fd9314c3d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): dashboard/components/FragmentGraph.tsx:246 \u00B7 dashboard/components/FragmentGraph.tsx: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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14e46dd19f988f4d5202ab0507132f5e0c17ca57d0a2900b37583c134aa11f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): dashboard/pages/await_tree.tsx:103 \u00B7 dashboard/pages/fragment_graph.tsx:372 \u00B7 dashboard/pages/heap_profiling.tsx:204 \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":"dashboard/pages/await_tree.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a60f04bb8a2ea436c33ad52eea601a1cd05d74963e52667982977957bc7438"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): dashboard/components/FragmentDependencyGraph.tsx:159 \u00B7 dashboard/components/FragmentDependencyGraph.tsx:171 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/components/FragmentDependencyGraph.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bd626147662ebfd630e4976cd17841b2521d0414b93810d5082e9235de1eb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): dashboard/components/FragmentGraph.tsx:188 \u00B7 dashboard/components/RelationGraph.tsx:127 \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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cfc790145b63e12f8393e523e96062f3e3ccbf5d0e83a84172942c63de82bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): dashboard/components/FragmentGraph.tsx:148 \u00B7 dashboard/components/RelationGraph.tsx:92 \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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58dfb3e0ac8535128161c3454334468b2f3d71ee537d3ecf6f2e31dbaf1cf25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): dashboard/components/utils/backPressure.tsx:19 \u00B7 dashboard/components/utils/backPressure.tsx: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":"dashboard/components/utils/backPressure.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1f68e944e0bfbc1c29e8e13d19ef8f2230c80fde0808397d1ecf4fa5f6f103"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): dashboard/components/FragmentGraph.tsx:509 \u00B7 dashboard/components/RelationGraph.tsx:203 \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":"dashboard/components/FragmentGraph.tsx"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5689bf02d7424f373baddb390fedad37e1c0c343466d7253ad9d3fc5691063e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): dashboard/pages/fragment_graph.tsx:403 \u00B7 dashboard/pages/fragment_graph.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c623dbe58e19082a7ec4e83475aa85c601efe321668c9ce7dd5c0845c6572e8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): dashboard/pages/await_tree.tsx:71 \u00B7 dashboard/pages/await_tree.tsx:80 \u00B7 dashboard/pages/await_tree.tsx:88 \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":"dashboard/pages/await_tree.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd74a13588a1b6686eaea9aab4ce22f24d7fdfced8e28506e2de777138817cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): dashboard/pages/fragment_graph.tsx:454 \u00B7 dashboard/pages/fragment_graph.tsx:462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/pages/fragment_graph.tsx"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed9ad7463413c0fb1df69b9ea32d77a570a85700508fc3b92cb402957465dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027formatUnixEpoch\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/lib/utils/timeUtils.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ac85981d142d5261ee91fcf7a1de319a747054111925c26f1271a6ae08cfa2"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u002716\u0027: Declared in dashboard/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":"cdccd64e70645597a7b77574e2abff17f642f894908aec8097b938c39b3d99c4"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@testing-library/react\u0027: Declared in dashboard/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":"f4fc98b2e9dd1df5b1cf8bb7443573817be87410d38993203326c750a8e30f13"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027d3-axis\u0027: Declared in dashboard/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":"f28c4264cd3922eb4ab2e9cec8625c49fd00adf9342848ad11b0469f3f537aa9"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): dashboard/components/CatalogModal.tsx \u2192 dashboard/components/Relations.tsx \u2192 dashboard/components/CatalogModal.tsx"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/components/CatalogModal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e7205654b60382ead3fcbce9faa6cd4bf82f09d1d0ac7f46854d705a024692"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): dashboard/lib/api/streamingStats.ts \u2192 dashboard/pages/fragment_graph.tsx \u2192 dashboard/lib/api/streamingStats.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/lib/api/streamingStats.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d307dc68da9f9dedcea98bb8e70946039282aabfe7f5e1d3669fc67bde45679d"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: No Content-Security-Policy / X-Frame-Options / X-Content-Type-Options configuration found \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060Dockerfile\u0060 builds the web-server image that serves this application, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integration_tests/iceberg-sink/Dockerfile"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3d3b10571f8a65ec8e3b064672215c65f1dae5dff18113257289eb5c3e9f8c"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"CWE-1104","shortDescription":{"text":"CWE-1104"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"CWE-248","shortDescription":{"text":"CWE-248"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"CWE-319","shortDescription":{"text":"CWE-319"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"CWE-328","shortDescription":{"text":"CWE-328"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"CWE-338","shortDescription":{"text":"CWE-338"},"helpUri":"https://cwe.mitre.org/data/definitions/338.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"CWE-345","shortDescription":{"text":"CWE-345"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"CWE-502","shortDescription":{"text":"CWE-502"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"CWE-552","shortDescription":{"text":"CWE-552"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-653","guid":"aa3e371b-590e-225d-a56c-cd490a1dca63","name":"CWE-653","shortDescription":{"text":"CWE-653"},"helpUri":"https://cwe.mitre.org/data/definitions/653.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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":299,"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."]}]}