{"$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":"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":"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":"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":"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":"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"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseShow (cyclomatic 275): MySqlStatementParser.parseShow has cyclomatic complexity 275 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a782ebbd4852dd9262de652e756acf3b2e203a56c1b36854e035692518507b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.primary (cyclomatic 202): SQLExprParser.primary has cyclomatic complexity 202 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9145b94825ab769f5ce4c75ac846214ebba8eb252340eb3e332a7e16f312d351"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseTableSourceRest (cyclomatic 161): SQLSelectParser.parseTableSourceRest has cyclomatic complexity 161 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adc1e55fad606f5b488c17daaa9cb0f6e538c2884f1a570c2778f1570e508b2"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsCreateTableParser.parseCreateTable (cyclomatic 152): OdpsCreateTableParser.parseCreateTable has cyclomatic complexity 152 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6ce83e308603cd9bd5b82b400603fcfae68aac829f0468df6fdd36c5d50f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseStatementListDialect (cyclomatic 149): MySqlStatementParser.parseStatementListDialect has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe961636ba6777aa7388a614ce372d4dc82760b35301ac9fd452d0b1e9752399"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParser.alias (cyclomatic 142): SQLParser.alias has cyclomatic complexity 142 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1641e1b762a3acd1955bb6cef7cc33ab80d89fd46939343a6b6865ae7baaba1"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanSQLType (cyclomatic 138): Lexer.scanSQLType has cyclomatic complexity 138 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"5716938549b5e4c7a24b3b7653bc02de8012a03b2a42ed82f9b543160ad8cf35"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.name (cyclomatic 138): SQLExprParser.name has cyclomatic complexity 138 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6e0d6cca5775ab9a6865716c2829aa4c98fe4b3475033e27259ec5d1fd4136"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlCreateTableParser.parseCreateTable (cyclomatic 114): MySqlCreateTableParser.parseCreateTable has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1326d9ceffc61d661633bf1bc9cb9d3f2fd4ea0a4477d855f1f1ec7d9879b"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseAlterSpecification (cyclomatic 114): MySqlStatementParser.parseAlterSpecification has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef688f4a34e78f5febf01e31d5f9e976796f111310c75dcc6711d1ce6427c9c1"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseStatementList (cyclomatic 113): OracleStatementParser.parseStatementList has cyclomatic complexity 113 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26834651c1581b1dfc8bb8f8ab57a203e33edfef73c695441f9fe0676e27bf0"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsStatementParser.parseStatementListDialect (cyclomatic 104): OdpsStatementParser.parseStatementListDialect has cyclomatic complexity 104 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af98eb0d1c760efb83552a8472b0f556e8f97f6fc123750a4554ecbf61672f4"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLTimestampExpr.check (cyclomatic 100): SQLTimestampExpr.check has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d1a1066afe4693ac51b40aaa88bf985824060a38b89d0df577a738980e38c3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlUtils.parseDateTime (cyclomatic 98): MySqlUtils.parseDateTime has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"108e549758246059c57c0c161b508aef873037fecf5a98323a6b993410e79b58"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParser.as (cyclomatic 97): SQLParser.as has cyclomatic complexity 97 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"234898547b1f463fc9814e6ab5dbec02d1961b492bb244d55453536aa4431e45"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.nextToken (cyclomatic 94): Lexer.nextToken has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca02bdac0715b96711b988094b3cc63442060c8b56e527ef316ae6889690fde"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlUtils.parseDate (cyclomatic 93): MySqlUtils.parseDate has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac868d902c11936cd1fcce51960a20f822ab1ed19c042cd16221f191d9618c6"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.visit (cyclomatic 92): SQLEvalVisitorUtils.visit has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64cbeed6cffabb656e2894012e03eec72ab8e546cfcdf976bd4aee675550711"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.parseSelectItem (cyclomatic 90): SQLExprParser.parseSelectItem 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5859}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ebdedf039edb1cd778cae0c37f4e8a6fa3f96dd0d98fb4263994c0b690b607"}},{"ruleId":"D1","level":"warning","message":{"text":"WebAppStat.computeUserAgent (cyclomatic 90): WebAppStat.computeUserAgent has cyclomatic complexity 90 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStat.java"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6307cfb5729c74188e899abc7dca2732b8bd2995778f583866f27a314b7ee81"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.primary (cyclomatic 89): MySqlExprParser.primary has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d20114b0c673bb4192660fcebef533a1d60c895c7841fa9d05ea14fbab4078f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.relationalRest (cyclomatic 86): SQLExprParser.relationalRest has cyclomatic complexity 86 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"0075a6d1b662b10acceaa5222dc294d2a824352b462a276520aa163b8d9fe736"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParser.tableAliasFromOptionalKeyword (cyclomatic 83): SQLParser.tableAliasFromOptionalKeyword has cyclomatic complexity 83 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2757665d67a1d37f88b0e9ba03a07065273fad88ecb8969554ffe2f7bf9d23b0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parsePrivilege (cyclomatic 79): SQLStatementParser.parsePrivilege 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"52758c5d42e10e5cf47dc7f31ca891a279e20b5d194483079c153e23730abeda"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseStatementList (cyclomatic 79): SQLStatementParser.parseStatementList 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e9b3b4993fbfe4df4da43be668723dec45a204d3220e3a7f5c4c3f2dc7c7ad"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseValueClauseNative (cyclomatic 79): SQLStatementParser.parseValueClauseNative 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6057}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be9f99a20f961d9c229755053b056895b27ad5cac90eb690f6b8e4dc4c51aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"JdbcUtils.getDbTypeRaw (cyclomatic 78): JdbcUtils.getDbTypeRaw has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d87d50bd6e0a4698326dd4f9fd63f109aea001bfa733d216faaad3c30af91c"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseInsert (cyclomatic 73): MySqlStatementParser.parseInsert 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7bb1ca0e8cd79652d67d5e1b6602e85bb915aed3dd0d0ed59c91b7828e96de"}},{"ruleId":"D1","level":"warning","message":{"text":"JdbcUtils.getDriverClassName (cyclomatic 73): JdbcUtils.getDriverClassName 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":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89c45f53e94a7accc2e6b270807697d45213b398cf4e349f7f3dfb1eb563be7"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlCreateTableParser.parseOptions (cyclomatic 71): MySqlCreateTableParser.parseOptions 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4b6d21f4a24aeae5e281282dcd3640363b7806d95e5eddcaccc3f2de2aa46a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.visit (cyclomatic 70): SQLEvalVisitorUtils.visit has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04e11623918359eda11b87e4c80098695ac6acca27294d133a75d171d578c22"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLDataTypeImpl.jdbcType (cyclomatic 69): SQLDataTypeImpl.jdbcType has cyclomatic complexity 69 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b6d3daf469da7e42351b0a1e599a4b9bb5009aa887b199c9a0c8374a254694"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleCreateTableParser.parseCreateTable (cyclomatic 67): OracleCreateTableParser.parseCreateTable has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"48843f12478542cd7c9e8b4f3b08e2e28e4b45a76c3312896a39f9afd456a989"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseValueClause (cyclomatic 67): SQLStatementParser.parseValueClause has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6662}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e91c5a0c79b5b666cac358cb16740974a023d6f0a5f8bf7d79b5fb9d303c158"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parseSelectItemRest (cyclomatic 66): MySqlExprParser.parseSelectItemRest has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f95ea94124f355419d8a3371c117182b33e05b93f11bd0c5aebcb263743647"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 66): SQLASTOutputVisitor.visit has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10478}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7c2393f7a01d50369939eabdd1467f909cd66ce8399ce22759fe3eac80ad73"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 65): MySqlOutputVisitor.visit has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3410f55c17f813aa3c9381efe1fc0f9e6ea7365d55dd2678d2fd054d6b526962"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolveIdent (cyclomatic 65): SchemaResolveVisitorFactory.resolveIdent has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b21df370ec8ca1ea130b21c16324cbbba066f1f04a7954c64b84be251f0a1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseValueClause (cyclomatic 64): SQLStatementParser.parseValueClause 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98f4775b15f4a03dbcfdb7f8dd1dfec1fae5736e3df64e67a723ec9938d5b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.primary (cyclomatic 63): OracleExprParser.primary has cyclomatic complexity 63 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1ad611e8ff1939a8cef932ddccf16c14a3d57a952645d66f20df29b5afb9e5"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseOracleExceptionSorter.isExceptionFatal (cyclomatic 61): OceanBaseOracleExceptionSorter.isExceptionFatal 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":"core/src/main/java/com/alibaba/druid/pool/vendor/OceanBaseOracleExceptionSorter.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbb2113be299b5b2b53ae39f0c49806b9c3fa0b1b9e047a1edace9bdf164942"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlLexer.scanComment (cyclomatic 61): MySqlLexer.scanComment has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6601448f0b8b1125b7fe14c08a19998b4c86c953d9b3744e55cd01d26f4c2ea"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsExprParser.primaryRest (cyclomatic 61): OdpsExprParser.primaryRest has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"0894485d303a69ab9e6c285c183827e5930992dcfd13770c21c5433fe1ff0a96"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.methodRest (cyclomatic 60): SQLExprParser.methodRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7fe020182f98b4569f9b2448f192bec88bddf3f51a2130dbc7cd8786173999"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 59): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd8019b684442e1fc59b57e17c159394eda0cd12f81f467bce54eef08e1661b"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExceptionSorter.isExceptionFatal (cyclomatic 57): OracleExceptionSorter.isExceptionFatal 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":"core/src/main/java/com/alibaba/druid/pool/vendor/OracleExceptionSorter.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"73affb0ebff97cc83968930dc2dbdd98ad37f4519e1d9212020f870a0259317c"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveStatementParser.parseStatementListDialect (cyclomatic 56): HiveStatementParser.parseStatementListDialect has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1400ed04e08795521fc0bb10b7e9af6ed9c0d473afd1d39e44c4ba9b7f0d9435"}},{"ruleId":"D1","level":"warning","message":{"text":"CalciteMySqlNodeVisitor.visit (cyclomatic 56): CalciteMySqlNodeVisitor.visit has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f3c6e24cba4c9eb786f41d1f81b7cdacd8c7dd8740372f4d3fa042c7a85726"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 54): MySqlOutputVisitor.visit has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14800179009f98fe2900ad1029dcd2eb2d6826434bfee3c5fb18d2348ba2fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanOperator (cyclomatic 54): Lexer.scanOperator has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe21904fe5feb85425fbe3eabc4657a6c92c41fab3706ad54168c21544f89c5"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.queryRest (cyclomatic 54): SQLSelectParser.queryRest has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a44b548084da67ec59d80350f48fa8833839b6c0cda31616d8bbca088484423"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanNumber (cyclomatic 52): Lexer.scanNumber 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6e6b7ae83c86ff49d6222d45dd087a266b28bf9e14b67d6231d5455d52649f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParserUtils.splitAndRemoveComment (cyclomatic 52): SQLParserUtils.splitAndRemoveComment 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33ff09999ed46da9289a3b8335c7050a3470a67b7231d41853b137130705d07"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsStatementParser.parseShow (cyclomatic 51): OdpsStatementParser.parseShow has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd9b38c2d7e3c6022680b0c4b6d7c362faf4159c59eb045c16ad02fe0d00f97"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSourceFactory.config (cyclomatic 50): DruidDataSourceFactory.config has cyclomatic complexity 50 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSourceFactory.java"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a52e0c06983a5f143957ab9e216d4930e0907a834d24ebb4ca316ecb99effa3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 50): MySqlOutputVisitor.visit has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d828bd30eb9d390cb2e124e7a546800fe685e270d4b902cb9be0d543546479c"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cyclomatic 50): SchemaResolveVisitorFactory.resolve has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"713b09e39cb5ea855c10f93446179bbe224154d8fdbbef9ecd043ce3bdaa1134"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 50): SQLASTOutputVisitor.visit has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d806842b97035a64c6c05e5716a8c79bd507b04b18ba9c9441de5cdc8ca5401"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 49): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffe9e4685ec201371e134b55a1067b866814cf21f2d4739aebf4a05b9768966"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parserParameters (cyclomatic 49): OracleStatementParser.parserParameters 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3c88775477edcdf81057f3c51698ee6fb4c2511fa691e2a9e4bf9e739fdd21"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 49): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec58eb1659f8a964cddcfb75c627dc15df2e955c95e7315d0433020a3015319"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.init (cyclomatic 48): DruidDataSource.init has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"4970b1a028c9f927522202582aa0e318ac14ce3a1894366c527ab8b5fab59157"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseCreateDatabase (cyclomatic 48): MySqlStatementParser.parseCreateDatabase has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82319f73bd96f29cf130b27d7dea0e66ad9d29417c0fbc26cd17f3b173a6b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsSelectParser.query (cyclomatic 48): OdpsSelectParser.query has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aee4ddb57cc5af0d73f1f4e032e20edc45ca322cb95b8c2504b823dfe7805a"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.primaryRest (cyclomatic 48): OracleExprParser.primaryRest has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bd3e092bed48325a25a58280f681b10c3978f087cf92b0a35f5452d03445d2"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.parseDataType (cyclomatic 48): SQLExprParser.parseDataType has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e563dbaae30380c49af8297537d5f56da27a551eb1b5989ad0d4d5d86e2a1ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"TDDLHint.\u003Cinit\u003E (cyclomatic 47): TDDLHint.\u003Cinit\u003E 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":"core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7247af471a888c3fb63954242f3a24615938499949e00732a707f293529dde1"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveCreateTableParser.parseCreateTableRest (cyclomatic 47): HiveCreateTableParser.parseCreateTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55af47b8cddee991492ffac649d2c6b4c7cfab44f68ef5b7a90aab966ee8edf"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlSelectParser.query (cyclomatic 47): MySqlSelectParser.query 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c5ad81d80b78eeaa5daeedb2db06e8a192eee85184a2f4e10b0b144223bb14"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visitInternal (cyclomatic 47): SQLASTOutputVisitor.visitInternal 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd50ab32dd4c39e9cc03f84aef129d15983a651511b14284d2dd71f0bc3184de"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.parseColumnRest (cyclomatic 46): SQLExprParser.parseColumnRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4855}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf8d7f138431987f0c322c8968c5f6ccd75d595dbaa48a70f880d3f542d6038"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 46): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8848}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2ff02900dbb306dec8e487fc5687249ec92d3b1717423a5fd63d7af774c2e5"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 45): MySqlOutputVisitor.visit has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4794}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cc50de465942139af16c9616045292db6ef47482f8985cb9da6efd5d2bdcb0"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 45): OracleOutputVisitor.visit has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfff63d7908f14187b0877a04c24847320d8f0f65b653a6e306eb0eeb51bb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLUtils.createFormatOutputVisitor (cyclomatic 45): SQLUtils.createFormatOutputVisitor has cyclomatic complexity 45 (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":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"630fc6041245bd4299413029a63c5af9c2c1c6923ffcd74006184d3cfcdc7004"}},{"ruleId":"D1","level":"warning","message":{"text":"WallProvider.checkInternal (cyclomatic 45): WallProvider.checkInternal has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/WallProvider.java"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab22a87ef6b36f224df433793b15abea43356174dbc831879999f1ae0a163679"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.visit (cyclomatic 44): SchemaStatVisitor.visit has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc0660c5c2472eadb449c11085dee8e6c813d6ecb67cee162e561e18c379ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.shrink (cyclomatic 43): DruidDataSource.shrink 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"010aa12003ee426646c604789cbfa46be940efe19767247dda1ab166191016f4"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.equals (cyclomatic 43): SQLSelectQueryBlock.equals 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9320bc8d89c9b46c0e8fca27aad3d59da8e749f3c02af70245860f96a509e96"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseProcedureStatementList (cyclomatic 43): MySqlStatementParser.parseProcedureStatementList 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2659ad75596402d0ffa5c79c508e5f157d202a55d1d180e02b9f660e7c991c10"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleRowNumToLimit.visit (cyclomatic 43): OracleRowNumToLimit.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0580831a0f08be0348c0b0a8e504f33a5a3e734447b7f4f2d18a0c8ba46fd609"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseCreate (cyclomatic 43): SQLStatementParser.parseCreate 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4096}}}],"partialFingerprints":{"codehealthFindingId/v1":"f821e11862c061a83f14d0017e761549a1307fb8374c95c1193e2b6a759959b1"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseDrop (cyclomatic 43): SQLStatementParser.parseDrop 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e567ae43ed931951a8d7b607268f212d16662f7abc711954b397a6418c74a0e4"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 43): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"155fb39d3853abbed9ffffc3639b8415066a67673a8dceccaf858ff677b0fb4f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 43): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8d7a5c508c3daa61fa6f1905a2d77f7fa9f39203d4cb8a0b7d2f752f2023b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanSQLTypeV2 (cyclomatic 42): Lexer.scanSQLTypeV2 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"e719c1ba0a0f29926ca299e5075b4eb28781765d096ee716d6a3bdfc53d81743"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParser.tableAlias (cyclomatic 42): SQLParser.tableAlias 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"528d12d22deab3d4d02777242d170d545c907236d83ff3e5a4aabe16e8decc05"}},{"ruleId":"D1","level":"warning","message":{"text":"StringUtils.isNumber (cyclomatic 42): StringUtils.isNumber 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":"core/src/main/java/com/alibaba/druid/util/StringUtils.java"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dc5d9bb5c067ce5809d38f4b2780d429584778fa5f71723418ec6820cdddf3"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidAbstractDataSource.createPhysicalConnection (cyclomatic 41): DruidAbstractDataSource.createPhysicalConnection 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5bccaaff7e1866253c9392636180453b4cf718613c255910dbcd4531bef146"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parseTableOptions (cyclomatic 41): MySqlExprParser.parseTableOptions 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"678092bf8429b17e7f3ba6de206455dbe3fc586f1ffc6c6e9aeee60e8b27294f"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarSelectParser.query (cyclomatic 41): OscarSelectParser.query 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"615db08dca26d0f83d3a1bf7b9c0ee8f852a94a0d6fdfe238f75646fa9c1558e"}},{"ruleId":"D1","level":"warning","message":{"text":"PGSelectParser.query (cyclomatic 41): PGSelectParser.query 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c462fafdf5762aea8e94512d87d54375401ed48613c3f0b077115d10237b1136"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseStatementListNonStandard (cyclomatic 41): SQLStatementParser.parseStatementListNonStandard has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"578b77d620cfe026aacc3f531c9ccb0e202cbcd11508eb808b1b1e2434883c64"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 41): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c11466ae3fe24bff0e0b7536a6de7d32c435775e7f60863331bf9bebc37102"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 41): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d952c5da95aadf58f525760047def4cd414ce9e3fac456f72d7f406183b3770"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.visit (cyclomatic 41): SchemaStatVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"917c774e7cde7222dede4dff5b3f358445cf13b422c291c91a7b02f343dbb68c"}},{"ruleId":"D1","level":"warning","message":{"text":"StringUtils.isNumber (cyclomatic 41): StringUtils.isNumber 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":"core/src/main/java/com/alibaba/druid/util/StringUtils.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9fd9b107586dfc0c5304ab86488fbb043ae1d00c982f83b54b206496ae6992"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.equalsForMergeJoin (cyclomatic 40): SQLSelectQueryBlock.equalsForMergeJoin has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ac800e96d89803895e27a29227632fb9efa78dd540aaa881c67c6367e603e"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlSelectParser.parseTableSource (cyclomatic 40): MySqlSelectParser.parseTableSource has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e02b15fbf0632319c61e486ec210d19f58ad0e8ba72d56882835633b6a6d50"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parserAlter (cyclomatic 40): OracleStatementParser.parserAlter has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eb7a19df69b668fa53425899072e70ac19c192c99988de117c69f8cdded6ed"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 40): PGOutputVisitor.visit has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"089868d676830d749533ddc236e803e9b8586216091b9b9c11c6e390cf363b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.over (cyclomatic 40): SQLExprParser.over has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2665}}}],"partialFingerprints":{"codehealthFindingId/v1":"5726f1ba30c7b066ad1176bc7ddff4c0989fbd7381fc3d1ae42a2463284ca16b"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.getConnectionInternal (cyclomatic 39): DruidDataSource.getConnectionInternal 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada5cdb3583f15e543dd8a582989ce5fefc3be5193b0295972b0ea388c358493"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLDateExpr.check (cyclomatic 39): SQLDateExpr.check 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed6cc6128c32f4ada20b41ce4e5725e59abaa01783e20592ad3eba03f9a7a91"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLTimestampNTZExpr.check (cyclomatic 39): SQLTimestampNTZExpr.check 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"605c2b8fa55ce13c1b576292321c8f52346887a1231fa14458ea9656e8868f6f"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlCreateTableParser.partitionClauseRest (cyclomatic 39): MySqlCreateTableParser.partitionClauseRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"71798c85e50d3874d7a16230f20afb3c2eff7389c93eaf298c001c28f34eb921"}},{"ruleId":"D1","level":"warning","message":{"text":"PGExprParser.primaryRest (cyclomatic 39): PGExprParser.primaryRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9ff0b6b7c52a556ca13852b3799f3651b2cba9eb83ab9b7c5a775b615acacd"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.inRest (cyclomatic 39): SQLExprParser.inRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2269c20c273ea8ce78264f7a91616ef28c8f21aabf4c28763472cc18a0f81460"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.primaryIdentifier (cyclomatic 39): SQLExprParser.primaryIdentifier 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7da4bca50e5a209ce1b67bbafc190455260509030b233ae2658fd7aa3a6bbe9"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.checkUpdate (cyclomatic 39): WallVisitorUtils.checkUpdate 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"847f356016b1bccf2850eb726bf3cdf100a0a740b484c8cf7b00c324a91ed703"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.getValue (cyclomatic 39): WallVisitorUtils.getValue 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ffb146798ca4d9f44e405ab246d7a488d3d7f662bf1f210b726caf12fb7321"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.configFromPropertiesAfterInit (cyclomatic 38): DruidDataSource.configFromPropertiesAfterInit 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9765495c1c43d3b710f9ce00d31bfadaa2534ee94d44483e91a19f5ec796f5"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveLexer.scanString (cyclomatic 38): HiveLexer.scanString 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"edffd333a460d2bd253ddebf5bcee2d4b9874a79918ee32750507ff2c9eb60af"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 38): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b8654526b489d72ff695e9627e079ec39c431f99c37155f1e1e9132e27783e"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExceptionSorter.isExceptionFatal (cyclomatic 37): MySqlExceptionSorter.isExceptionFatal 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":"core/src/main/java/com/alibaba/druid/pool/vendor/MySqlExceptionSorter.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6123dedfbfd11c29f29e202ab8825f6762cd9a247d0ed5bf146c6968e8348c2b"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseCreateMaterializedViewRest (cyclomatic 37): MySqlStatementParser.parseCreateMaterializedViewRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":9231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a865cfc90b8646228010508382f5331de406f809fd2b2e8631ed92ebfa685d8"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseWhere (cyclomatic 37): SQLSelectParser.parseWhere 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fcf2c4bf361eb49a51dc0fb96ba4607dade0416dc0c084f3db59e0df68e97d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitorBinaryOpSupport.visitBinaryOpExprGroup (cyclomatic 37): SQLASTOutputVisitorBinaryOpSupport.visitBinaryOpExprGroup 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitorBinaryOpSupport.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c10c075be9bf6c78426e48b3e57669c52eeaf423de292260e0aaf0292fd902"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlTypeUDF.evaluate (cyclomatic 37): SqlTypeUDF.evaluate 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":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlTypeUDF.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f93596f87f00efb5d74722a415a7c0ecd6122d56eafe9f7c11bee04a917d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.checkUnion (cyclomatic 37): WallVisitorUtils.checkUnion 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"760ed5d8a6ff69998835451a4480087f9b0bf7a87763789a9e865268efb59b66"}},{"ruleId":"D1","level":"warning","message":{"text":"DmSelectParser.query (cyclomatic 36): DmSelectParser.query 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6998558f81c5a6d5429217bbf972cce52776bce1b85c5ddb455661b0b88b4653"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveLexer.scanComment (cyclomatic 36): HiveLexer.scanComment 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71c5a38d3a246c2fa67e7a8fcecf0aadda5ee478a133e207c39008e501194ac"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 36): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2688c4e7e0ea277ab24f5e0093456f6bfa30f8c94048cd9a30b73fdc0a2625e"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 36): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40432e6187dcd3389b139c8b6389dd331777c438ae9cf7b2d908c20c890396e"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarExprParser.primaryRest (cyclomatic 36): OscarExprParser.primaryRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80a0ee566932a886a5f2e75a3ad868362308243b1acfd24fcd02a22538cf1fe"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 36): OscarOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabc3973777ad2456c12fc653dd00aae85b4f5e4a041ab9755e5ef2498c4f3c8"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 36): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd587b5ba00c1f694c415b07fa01b888ec3038eb6c1129a531f8327065938ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanVariable (cyclomatic 36): Lexer.scanVariable 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7e3a9a0c2f40456adc61277074abec4d1079f748274630fdb15920e18b71f9"}},{"ruleId":"D1","level":"warning","message":{"text":"WallFilter.initWallProviderInternal (cyclomatic 36): WallFilter.initWallProviderInternal 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":"core/src/main/java/com/alibaba/druid/wall/WallFilter.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32b3f8fc2e6dacfcdaff198da4cf57d88b22b11fb0c4a11b2c445a9454f60dd"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlLexer.scanIdentifier (cyclomatic 35): MySqlLexer.scanIdentifier 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0066348ec6e37a88c81180b4a6d6b211e344011eab1b08823bd43aabffa6659b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseGroupBy (cyclomatic 35): SQLSelectParser.parseGroupBy 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de589c35f1151a5e04147c0a622ff9cb12eda8409ad4be0c4727df23a83dc3e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printTableSourceExpr (cyclomatic 35): SQLASTOutputVisitor.printTableSourceExpr 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc1366df3bac420edb8a5bb208974c3e204ba45655484918188913c67471537"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 35): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6875}}}],"partialFingerprints":{"codehealthFindingId/v1":"7842d3b8eaf66a5668ac01172662bc6e8c2eb8da463d83f146ceee2df6cd035e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 35): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4715}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ff82aa5a9a2c0d7f5c78d4094eedb7d7301350f8ebd076429fcdeffe14078b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visitBinaryLeft (cyclomatic 35): SQLASTOutputVisitor.visitBinaryLeft 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"41af1fdd3da24af111438b89286febd6396071b4d9235066d91615928838e55e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.div (cyclomatic 35): SQLEvalVisitorUtils.div 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"763d07bd303d280065f1bba814e9fdd3c262f6bbf3960147ab8d32199bd97a61"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSourceStatLoggerImpl.log (cyclomatic 34): DruidDataSourceStatLoggerImpl.log 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSourceStatLoggerImpl.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bb415a43d97159b757f1187668ce7ae05d22a7c7890b31c0671ef6e7d4469a"}},{"ruleId":"D1","level":"warning","message":{"text":"ImpalaCreateTableParser.parseCreateTableRest (cyclomatic 34): ImpalaCreateTableParser.parseCreateTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"91df00b8b526b79a7a0c51b2f9b50cb9a37ee66db226a1e3a0d9414541252a26"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parseIndexOptions (cyclomatic 34): MySqlExprParser.parseIndexOptions 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6667cbf0a69a1af7fe6ed51651b74a9baf64cf4305e1c1610d298eb274f69ae"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 34): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc03dbce5130837c1c25a93e0d09aa1b59a698dc7df85dfe9a42c49d2ffa9e3"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseCreateIndex (cyclomatic 34): OracleStatementParser.parseCreateIndex 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"461c260bd1a08cf2e82f611d19b397929fd96e4acb9ba341f1b41e400d29430a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 34): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5703}}}],"partialFingerprints":{"codehealthFindingId/v1":"b193e772387ebf69efc39e4b90ecbbc438850f57d7c7e4918f8b18db17aacfea"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.unwrapExpr (cyclomatic 34): SchemaStatVisitor.unwrapExpr 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"573fa639f30d6bfc71f2b7b98d90c563cf299506db650188f35de1e04c12fc91"}},{"ruleId":"D1","level":"warning","message":{"text":"JdbcUtils.printResultSet (cyclomatic 34): JdbcUtils.printResultSet 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":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd1f18282823e794ed71dabbd2ea3120588f3ad49fcea2d39f0916ae30e6b34"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parseColumnRest (cyclomatic 33): MySqlExprParser.parseColumnRest has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1506774d4ff264a37158f4f23bbc72d0b277cbe45c7af4105b00122d5bd128"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 33): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4544f73be0895af054e87959000c807a1d8462983a60e6d77d4f4d15130d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.getColumn (cyclomatic 33): SchemaStatVisitor.getColumn 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"248b9b9accd29a4f30258a7b10c0487acef27d792ec60d92fcc814b8c560debd"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.preVisitCheck (cyclomatic 33): WallVisitorUtils.preVisitCheck has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b7ecfb208f58163f038f69657026e67f1215b2c504275a321e6cf1aba73076"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLBinaryOpExpr.computeDataType (cyclomatic 32): SQLBinaryOpExpr.computeDataType has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9881da3025eee0a8c883f164208fd0bbea6c6692bfca9ce1dc77d187713b0d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLMethodInvokeExpr.computeDataType (cyclomatic 32): SQLMethodInvokeExpr.computeDataType has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f6142091a50a423f261875837bb0bb3eec16559a8634ae75a1587985e1e2df"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlLexer.scanString (cyclomatic 32): MySqlLexer.scanString has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e98afbac6e69174e93e9efa7d90a907f57cf9aaac6ee3a3fc7640eea55fe55"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseFlush (cyclomatic 32): MySqlStatementParser.parseFlush has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5663ee0de8a0a4e218e055bd662535f47d3124c057f4d8ed168c9486192062"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 32): MySqlOutputVisitor.visit has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3948}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11725bda1ef2d86fd310cf78a54292388d3eb3682e59c3782f9f60de33ed9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.parseDataType (cyclomatic 32): OracleExprParser.parseDataType has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecfa6cc6903e58944d540eeb6bbf535f87849f5ba69dc4cb832f771a70ff85a"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 32): OscarOutputVisitor.visit has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e6e7398aa52d20bcf54a4153b3ed9038965adfcb5fe0007d78f33e3d96d955"}},{"ruleId":"D1","level":"warning","message":{"text":"PrestoStatementParser.parseStatementListDialect (cyclomatic 32): PrestoStatementParser.parseStatementListDialect has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"282827f447ad84d7572e03b7c45084b654f53be8b3720c62ffbd520e5df17ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseTableSource (cyclomatic 32): SQLSelectParser.parseTableSource has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab05a95a7b1ecac430970bf62bbf93a3e77d06c2135679a7ed662ae02b90dc2"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.visitOrderBy (cyclomatic 32): SchemaStatVisitor.visitOrderBy has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5cea1b7ffac98bc8add925437eb8e94a5ac871f04180a02495d2e66f21f945"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.getValue (cyclomatic 32): WallVisitorUtils.getValue has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3112f850b051e0b3cdd140a4b3b074950904bc300a5e61bbbc659c1d5486d82"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.recycle (cyclomatic 31): DruidDataSource.recycle 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f77d0ad17d3cca2aec2b9059f829edb95d8234fd9660d7795d36b4b772c8c23"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleToMySqlOutputVisitor.visit (cyclomatic 31): OracleToMySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleToMySqlOutputVisitor.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c355cc7576008185bead2d4bb797e1b4b7d6dd677ced46c176d810e7ac2f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanAlias (cyclomatic 31): Lexer.scanAlias 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99bd7617f14354730deffd10afa7872078119be2ff0918d5bcaa8f65a12e4bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.alterTableAfterName (cyclomatic 31): SQLStatementParser.alterTableAfterName 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4ec5a69acff3bd5011fc4d253cb3cd03849b248e53d6f372c84a785d6003e1"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.add (cyclomatic 31): SQLEvalVisitorUtils.add 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8e6ddaec5ea4cac96d74a31b0ffc22900f027531956eee228fa00092eb625f"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlUtils.getLastPacketReceivedTimeMs (cyclomatic 31): MySqlUtils.getLastPacketReceivedTimeMs 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":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf95cde31ce5302c3d696ec7c7c5d2400255e1227adff1dd8e1d9e9b2da471c"}},{"ruleId":"D1","level":"warning","message":{"text":"GaussDbStatementParser.parseInsert (cyclomatic 30): GaussDbStatementParser.parseInsert 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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5040ce966412418c25e9aeda9974aa7298ea66e59ea35d06196e7cc61f1e0e"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.primaryRest (cyclomatic 30): MySqlExprParser.primaryRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4205b97e78453a3a44a8616e9d968c1500469427c743521ae1f2c9ee4bf577e2"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.parseAggregateExpr (cyclomatic 30): OracleExprParser.parseAggregateExpr 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a21ea07584e3aed3202e287d4867b6301389e3c73c9ee0eade72cea6ce937a"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleSelectParser.parseTableSourceRest (cyclomatic 30): OracleSelectParser.parseTableSourceRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"03001e8aa946595576c7f1bf0c70879eee9ee17ecf50324f33cb4e9c940c0a88"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseAlterTable (cyclomatic 30): OracleStatementParser.parseAlterTable 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fe605a0b5a66cdca577dad4f616ec8e795a54a8148bb06439bc2b370b3c387"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 30): OscarOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d69b72d525c6df5dfcce155dc5fc271377ab12f024c39436249c7a957a08fb"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 30): OscarOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce50b15fb89817e683d42a78de1d51f252d99f1d9817eeb87d52980c43d4a675"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 30): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd55c635a51fa5716610719a5854e45b2bb978ae6a62a24069b43c3129275d"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 30): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"083ad787260915a65f1409712b2144b9f13e220fdeb6b290609ec2fd5793b042"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.expr (cyclomatic 30): SQLExprParser.expr 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6faccf178ad0cf2839eefe884c53b0a0a2ced5a6098757290082a4d47916c3"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.primarySub (cyclomatic 30): SQLExprParser.primarySub 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff839da9d8397af332d8144a012a8f4cbc92faea8a80e368e73dff5efbb13b9"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cyclomatic 30): SchemaResolveVisitorFactory.resolve 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e635fe392ed0e834448324c7c992909521e3e8e1ea84145021da52ffe477d53"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.eq (cyclomatic 30): SQLEvalVisitorUtils.eq 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"05538b1204cb4a354c2af1473f75ec2d4c3c497e133cabd0512febfb61001e63"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.visit (cyclomatic 30): SchemaStatVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9262e7774e255dab41a50785e50344d26d70bc8e6edba928b4c320f82cad9f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.visit (cyclomatic 30): SchemaStatVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bbb8b7b9b912e7acabb65ed881645084a16956750eb04748b17ff249de0e6d"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlTypeUDF.getStmtSqlType (cyclomatic 30): SqlTypeUDF.getStmtSqlType 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":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlTypeUDF.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a12989b5e720d511c66eb48f1f4e1382da46f412efba4e0413adcf19faa08e"}},{"ruleId":"D1","level":"warning","message":{"text":"DB2ExprParser.primaryRest (cyclomatic 29): DB2ExprParser.primaryRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f362d4ccb1d28e84f27c55b46e758e307df3beb5ee0a08eed7b9451c0c9dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 29): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15ff987742831e10a33354cc56fa5f72aace59ce09a0e63f47e7297ffe32c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanIdentifier (cyclomatic 29): Lexer.scanIdentifier 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2585}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e623010334bda9c320a28707472ef29464ce4d5447a1dcb00fab6b14747654"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanIdentifier0 (cyclomatic 29): Lexer.scanIdentifier0 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2721}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1d72baa47be569354f16e64d0c38324b31d4c92ddd56e48bc5afbfc81a2371"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParserUtils.split (cyclomatic 29): SQLParserUtils.split 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec0229bc9c9a106f0af75b0d261de44224c21980ad20c75f56ffafaafc1f002"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseGrant (cyclomatic 29): SQLStatementParser.parseGrant 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad22a295427bd33f353bb5efd8f24ff019fcfa497a77a8a069d21750457e263"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 29): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"33759d26301a078e96c721df7a43211184e50db25150de6154987ab7d39b7f75"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 29): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7019}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6323f5cd65bbce172b89bd31ca593a3908d24ad87c7acf54e53b6b204cf7782"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 29): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4531}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a0d84d0d992e13837217a2fe0d06f8fbf9f6fef47be4bf18d76a643790c764"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.sub (cyclomatic 29): SQLEvalVisitorUtils.sub has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbcf74092908f618facd79101e90e7b7d5aaac1e5aab0c4d6304bc4b9eb1284"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidStatService.service (cyclomatic 29): DruidStatService.service has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/DruidStatService.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb55267fba82e2b0a307f2378cf9426f21a8ccda9f55f4bfcc2cb4f71a08fd0"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlUtils.toJavaFormat (cyclomatic 29): MySqlUtils.toJavaFormat has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"0783eb4bcb73298e0d251003efcee803f7831ab00abb76c19186845ce2660d93"}},{"ruleId":"D1","level":"warning","message":{"text":"BigQueryLexer.scanAlias (cyclomatic 28): BigQueryLexer.scanAlias 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f95ace881680896c7754da3fdfeed08de492ef0dcccdc4be2ffd2b84aeff54f"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.printValuesList (cyclomatic 28): MySqlOutputVisitor.printValuesList 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdda6fe5aed70e981ffb3b55ea63a54127f52709e16028c28a22f76d02f01a53"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 28): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d28bcf5e26b4e86a78c9044e3e30b63ea929988755d497fdf4c00ba7857307e"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 28): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"92894657f5ed32ac2fbc952db1df20281a7bbc355cf2c4007c2cf2fe821cad54"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 28): OscarOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6522a793f9b03368bead5ffbf1837cfc828e2dcdd77c875fa7e12f798ccaf0"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 28): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb7753b947a97ffe37772f4609c07cd3185375cefdc4d368021d8d2972c962a"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.nextTokenValue (cyclomatic 28): Lexer.nextTokenValue has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7480bbc8feeae5576814d9efe7622433b0b1366317b4ab5d2d04490c6bcd5c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseCreateMaterializedView (cyclomatic 28): SQLStatementParser.parseCreateMaterializedView 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4345}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae42fd5ba39fe9a02d9788fc21c4b859d0891ef1b445338e8061b9b1c896c55"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaResolveVisitorFactory.extractColumns (cyclomatic 28): SchemaResolveVisitorFactory.extractColumns 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"333760412b4ca1f8fd6fcc44ae0af6ff4b012898268534d7ce0bef96f009c75a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 28): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bab7396b52aab2d2a3621586b812a50c0cb3a4812dae2c2c4dc752265a763fb"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 28): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d327d1790d52763a2002c05a15e05f3f535ab4210302f15bbc6c80da136b146"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlUtils.createXAConnection (cyclomatic 28): MySqlUtils.createXAConnection 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":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e01d91503984ce47047b7b4f8760e657fb1774e2ffce309fdfeb83bb4ed5c2"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateConnectionTask.runInternal (cyclomatic 27): CreateConnectionTask.runInternal 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc14ab6da2223423f759cf53b6e14e9ce919624344c28c46ca55043cfa5e3740"}},{"ruleId":"D1","level":"warning","message":{"text":"BigQueryLexer.scanString (cyclomatic 27): BigQueryLexer.scanString 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01307d3f6eacf3631856bfc94eea050453559602cc2953b19a4697682e09fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"DmOutputVisitor.visit (cyclomatic 27): DmOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"acddd5798fb7a990c67c6e1c17aa086f61f38ab38e3cce7e147e617edd9a582a"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parsePartition (cyclomatic 27): MySqlExprParser.parsePartition 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe564a4816dbe28a0f6114d690328026912cf457bd3c1642207f3c0cf220e7e"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.primaryIdentifierRest (cyclomatic 27): MySqlExprParser.primaryIdentifierRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fdfd028def0acb66af5ac5a63b4745c9f474110f42eff67cb17c4257b25ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlSelectParser.parseTableSourceRest (cyclomatic 27): MySqlSelectParser.parseTableSourceRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53b22ad1c91c3000d106f9195280da95c4487e6f72021e9940961adde62530a"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsStatementParser.parsePrivilege (cyclomatic 27): OdpsStatementParser.parsePrivilege 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c47aa6289df860a8a51e111e3bb000039e963992ceab59a4b512833f4d5994"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.notRationalRest (cyclomatic 27): SQLExprParser.notRationalRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20c035d7480598c92153486d3d200207df9f6207d02bbabc743e8ed8d8e2391"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.primaryRest (cyclomatic 27): SQLExprParser.primaryRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e6aedb6dbd4cae809e0cfdb37385cf538f4b7261c664465addbe707a622eae"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseCreateSequence (cyclomatic 27): SQLStatementParser.parseCreateSequence 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4728}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e65edf32bf44ba2dfdc6b366b5279a16f92e82d7033dd4655373569d0fe79c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseCreateView (cyclomatic 27): SQLStatementParser.parseCreateView 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5002}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a634d8511b4bacd6f084907a263debb9e8603df0dfd0b06879fc95b5a7430"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 27): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9871}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef47e9e1df2d55c1aa512afd7a56b36eaa02c56aae326094be196907967fb6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidStatManagerFacade.mergeWallStat (cyclomatic 27): DruidStatManagerFacade.mergeWallStat 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":"core/src/main/java/com/alibaba/druid/stat/DruidStatManagerFacade.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68cb7a961707002bbad7043c95eccdb5991c41ed3ab54d4a5b8f3d8afd65376"}},{"ruleId":"D1","level":"warning","message":{"text":"CalciteMySqlNodeVisitor.visit (cyclomatic 27): CalciteMySqlNodeVisitor.visit 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":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e83793c7b9ba9a80523910c7489a8f1e679ee45d2425c1b19b5fe2ab79a57ed"}},{"ruleId":"D1","level":"warning","message":{"text":"FnvHash.hashCode64 (cyclomatic 27): FnvHash.hashCode64 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":"core/src/main/java/com/alibaba/druid/util/FnvHash.java"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f2782c7e3c1ca90c36ffe7077b1d7fa80d787ee458e6a5cfe3edcb6142733f"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.check (cyclomatic 27): WallVisitorUtils.check 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d830a40fe7287f6c003552e12037a8b38bb910d00a8643eaf08da3833c087c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ProxoolDataSource.populatePropertiesFromReference (cyclomatic 27): ProxoolDataSource.populatePropertiesFromReference 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":"druid-wrapper/src/main/java/org/logicalcobwebs/proxool/ProxoolDataSource.java"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd85c1631c62bd27fc2ca8ad8e6b7036d15adf15c81d41254f631ce8dfc20ae"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateConnectionThread.run (cyclomatic 26): CreateConnectionThread.run 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a71f95c1122468463be79e3cf9607a39f2070a72b0e872c73f68ce3d7edf19d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelect.equals (cyclomatic 26): SQLSelect.equals 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelect.java"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d1614975f77faf7aae97dc706bffae7eb9ba0427811519d61fea913ae0c8c0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.cloneTo (cyclomatic 26): SQLSelectQueryBlock.cloneTo 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"513248f7790f82b2506810843632401066318a90e6eb404b4d9b03931bd3ef11"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseExplain (cyclomatic 26): MySqlStatementParser.parseExplain 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee25e9343958aa450c8142e5d2f9758d40df93530fba475bc631cb96145e105c"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseLoadDataInFile (cyclomatic 26): MySqlStatementParser.parseLoadDataInFile 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6f6354b87f00c487b442ef00103822d00d67e7810c5a8209f4fb23c5bb49ef"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseSet (cyclomatic 26): MySqlStatementParser.parseSet 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad4672a7dbf3f5676e21254c70d6c332e63f6c6a30ea9c4905c8fcd7ed70b30"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 26): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"000959fffe62ed9ce0b1614ac4ff0298e1a3053771d0a8c69e5b32e7b02a3dc7"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 26): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d9faced2795f03cd5407f73c3a895fc13bbeb4b907f5bfe6c159e45cc1c293"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 26): OscarOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093dcbc56567f67bd3fa7a129154349722c363e52436858287475e6f6be55b1"}},{"ruleId":"D1","level":"warning","message":{"text":"PGSelectParser.parseTableSourceTableSample (cyclomatic 26): PGSelectParser.parseTableSourceTableSample 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1177da6becce8a2087a3dc752fc7cb02e9a6b36393143e5cc10f5e2f57d3fd"}},{"ruleId":"D1","level":"warning","message":{"text":"SnowflakeStatementParser.parseShow (cyclomatic 26): SnowflakeStatementParser.parseShow 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a96b27a4d5a451763dc8d524a3ae357984143e70108b5cfc934408677eee209"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.alterSequence (cyclomatic 26): SQLStatementParser.alterSequence 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7356}}}],"partialFingerprints":{"codehealthFindingId/v1":"722b27949f88358d910c19e4c5fe5b7ffd5e6d2057f7369e93728d53cd76fd07"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseTruncate (cyclomatic 26): SQLStatementParser.parseTruncate 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3674}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a33b1ec4876a21340fcda1e509e333f4f9c5cc05af3038ff3320a6264d0164"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printParameter (cyclomatic 26): SQLASTOutputVisitor.printParameter 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64316ce94c3c83b3863aeba1f94f2c2383499ae4f2734f605e7b5cdf54ee77a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 26): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5588}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa458212bfca701ed33c17be2c58fc090ec3c24a7c2fcd82211eb337b8835438"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedStatementProxyImpl.setObjectParameter (cyclomatic 25): PreparedStatementProxyImpl.setObjectParameter has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/PreparedStatementProxyImpl.java"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0513fc0564239c4d29bef497c2c3f35323d5acbd9bbc00a7b1d11484ecdfb9"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseDeleteStatement (cyclomatic 25): MySqlStatementParser.parseDeleteStatement 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9484def9074ed2420ca21de9757e5b339cdf42f6ae870b868c1947991d578d2"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.printCreateFunctionBody (cyclomatic 25): OracleOutputVisitor.printCreateFunctionBody 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"367f759d314e33da6dfef4ed901afc61f4856ff2c83cfa6e4811a24ff3318a09"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanString2_d (cyclomatic 25): Lexer.scanString2_d 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7fbd9e2ee69305bc8f456a7a2cfefbc34e778328c9cfe201ae6179892f6a79"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.parseSelectOrderByItem (cyclomatic 25): SQLExprParser.parseSelectOrderByItem 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"5038e03e9623ec8951496bfd8370c4b30d8e48b66490466a92dd8d903df1f88a"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaRepository.acceptCreateTable (cyclomatic 25): SchemaRepository.acceptCreateTable 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1353a8f291af32c8c7e586b20a749d3938f9f1bf01545967ff8c12e5b7fac6"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportParameterVisitorUtils.exportParameter (cyclomatic 25): ExportParameterVisitorUtils.exportParameter 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":"core/src/main/java/com/alibaba/druid/sql/visitor/ExportParameterVisitorUtils.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e94c5928f23713671909b86e929c6927b02923d502e09965a3e14ad524a95c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 25): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":12280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe11d034287413d197cbaec4825e0ffdfbe8d69ed1794163ffc0c90ae1e34aea"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 25): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5984}}}],"partialFingerprints":{"codehealthFindingId/v1":"1543b57aed097c169f29d750bb6f3c64c3876bfdbf5b89b1faba044e9c9a2596"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.handleCondition (cyclomatic 25): SchemaStatVisitor.handleCondition 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"757329e3f84ad74a105ac4364414938436fb2f9460bfe956bd5ba1ae44987513"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLColumnDefinition.clone (cyclomatic 24): SQLColumnDefinition.clone 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLColumnDefinition.java"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"50501edafa8282ba560fbe86bba33e9ad7ffcf0539af01d14e4795206672a840"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlCreateTableParser.parsePartitionBy (cyclomatic 24): MySqlCreateTableParser.parsePartitionBy 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a154fc5a01023eb38cbd054e5cb8798b9e9636b2c835f3d10a1081cfddc83c"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 24): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5098}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2d31ea4d0650a0eadecd19f7ca7d387aa36de37a70b313409bcc1def4c470b"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsLexer.scanIdentifier (cyclomatic 24): OdpsLexer.scanIdentifier 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsLexer.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba0910ed7d972be0f53c290143e14c412ded8b337cac9037b825b2becf219d3"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleSelectParser.parsePivot (cyclomatic 24): OracleSelectParser.parsePivot 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"42881dbaf0db7cc00a9a3daa1d8778067510dc23594814f78e3e94e649743696"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 24): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3af4d6da1006d205fd8fcee5b06b6f89cfeadbad415b922e72d58ebe00242f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLServerLexer.scanComment (cyclomatic 24): SQLServerLexer.scanComment 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerLexer.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8333d3497bd425c2cbf8b73c1683dbf98b071051bb2eae1bbbbfed9bb8dad966"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.parseAssignItem (cyclomatic 24): SQLExprParser.parseAssignItem 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5417}}}],"partialFingerprints":{"codehealthFindingId/v1":"021a3a2908845900603237ba357a0496fca333c7971c3affaf75990f24b8350a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParserUtils.removeComment (cyclomatic 24): SQLParserUtils.removeComment 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f083d2889149a68156730bdfab57bdb09d81fc36e46cdff2f45866a6ed5106c"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cyclomatic 24): SchemaResolveVisitorFactory.resolve 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"750287b51d93981324f2987ff6e63da8177ca0b2bca832bcb6d07f013b40f258"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 24): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c6fe170455475a6d36352344ae23790072fdf0bb7db4ddf0068ce529a874e6"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.gt (cyclomatic 24): SQLEvalVisitorUtils.gt 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2049ea55d4c1765c970c60491eca8a2156b85fe000af582bff10c78d9a8b54f6"}},{"ruleId":"D1","level":"warning","message":{"text":"MonitorDaoJdbcImpl.load (cyclomatic 24): MonitorDaoJdbcImpl.load 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":"core/src/main/java/com/alibaba/druid/support/monitor/dao/MonitorDaoJdbcImpl.java"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"321f16d88b1a730fa29dd46f7147090a2d65c4231913e6ce9c019956e1ac438e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.hashCode (cyclomatic 23): SQLSelectQueryBlock.hashCode 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb20383f909f895ad1e86cf3649bf85c6eb38ff7c394795c5b9fd8a184e930a"}},{"ruleId":"D1","level":"warning","message":{"text":"DB2OutputVisitor.visit (cyclomatic 23): DB2OutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/visitor/DB2OutputVisitor.java"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b8f97f3494a5e60aa568ca45ee71cd7c6284407d97d79a887af73f81a4de9b"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveExprParser.parseSelectItemRest (cyclomatic 23): HiveExprParser.parseSelectItemRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6ee9da53d8ed49e3f8642f33775b53d1cf33a7b5fa9a9ef52c20e816d1e003"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parseInterval (cyclomatic 23): MySqlExprParser.parseInterval 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a94e2c2113b7255873c401b33ebda580af7ab7459ccde41dc36a86d5a07aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseAlterDrop (cyclomatic 23): MySqlStatementParser.parseAlterDrop 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e0e944fbdff9aa4384723bb5dd08eb7117fb11a0c5263648fcf599ffac085f"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 23): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"f994f4b411aa10f21caeb03ef2517ed1694c0871bbaa924944f8d5a6781f46cc"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.parseInterval (cyclomatic 23): OracleExprParser.parseInterval 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c6e7cdfcfe83adceefe677a405257b4ae1a6edac1427636883f5d479e4f6a3"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.parseSegmentAttributes (cyclomatic 23): OracleExprParser.parseSegmentAttributes 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dd7f7aa908d05980cc03b39a34318e282f20be44bcb2a78af6ea6bda8e1f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleLexer.scanComment (cyclomatic 23): OracleLexer.scanComment 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5494e4a928923832ceb517a62f7451b0c17fa37b904daf6f9b3f756173516984"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleSelectParser.select (cyclomatic 23): OracleSelectParser.select 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34bfa09e8df498b321f90a4e976a4c0c30e9f1a33d159f02db78a8facb41f71"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseFunction (cyclomatic 23): OracleStatementParser.parseFunction 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"962d41ebefe8c34c342ba1ed67825398821390bebdfba0413dc54483ae094fef"}},{"ruleId":"D1","level":"warning","message":{"text":"PGExprParser.primary (cyclomatic 23): PGExprParser.primary 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6481af2c97789f690128707e097fd44b8ff516b1c6adc888b74f58f7ccb68cf"}},{"ruleId":"D1","level":"warning","message":{"text":"PGSQLStatementParser.parseInsert (cyclomatic 23): PGSQLStatementParser.parseInsert 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca829431c6ab38917a059a78b74ec34b9b571f4f371d20846933fb1acfa436a"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 23): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7412249f8fbc8d2826f0929dcd351ee437af69ff56acb817367f97df0e177ead"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 23): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de4380437788e7bb947b7baa9b4cdba5bf933d9504181ec29b60f98d5f0dba0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseHiveInsertStmt (cyclomatic 23): SQLStatementParser.parseHiveInsertStmt 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb8e10782fb43a8c4e0c5a6e2dc91c0fbb0dfe38aacdb027e1a8ebdfac87f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.multi (cyclomatic 23): SQLEvalVisitorUtils.multi 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2b09a24659efb5d4ee58391bcc62d08c0df8230fbe5da05f206b98e720eaea"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaStatVisitor.visit (cyclomatic 23): SchemaStatVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5560b6dbf905c57c021645f8fa43a0b38908e3a350b687e487ed4288f2ef37b1"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.queryBlockFromIsNull (cyclomatic 23): WallVisitorUtils.queryBlockFromIsNull 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"82225f2906106110d49aedc402d147963c30ca1a1a4ceb010339b66c603c3727"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLCreateTableStatement.sort (cyclomatic 22): SQLCreateTableStatement.sort 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0e9636d32367dd1fc7d81d154d06d4fead8c13855bf787f8d4d062c5991b3c"}},{"ruleId":"D1","level":"warning","message":{"text":"DB2SelectParser.query (cyclomatic 22): DB2SelectParser.query 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"38da8c3d5311cea592154257c2535d97098018de099061087381ba8fd8686fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveOutputVisitor.visit (cyclomatic 22): HiveOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10b457cdcdd189504b93bad93df4c29e16dc36272dccd5efcc2f945e074cdcb"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlSelectQueryBlock.accept0 (cyclomatic 22): MySqlSelectQueryBlock.accept0 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSelectQueryBlock.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cd8be00b39d829ee14e189f3de7990568799a2a47302e0f47be7d5493fd8ad"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlSelectQueryBlock.equals (cyclomatic 22): MySqlSelectQueryBlock.equals 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSelectQueryBlock.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e03c98173b6c59533c109c6271bc4febddd58151c2a8207d44a65d5bb69b3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlLexer.skipFirstHintsOrMultiCommentAndNextToken (cyclomatic 22): MySqlLexer.skipFirstHintsOrMultiCommentAndNextToken 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"87931d8339d38005d924336e4086e1423c757677e62e60514d98e6d3ec61beaf"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.alterView (cyclomatic 22): MySqlStatementParser.alterView 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5200}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d1c5e1cd4ccc998c6f2d4cca14fc5bd93f619956d992a19d5a4251f834368e"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 22): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3de0cc25bd7349322da21568774788918c17094f198284c5788b21a56bfd02"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 22): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"f108300ecd6a7c31b56a84583944c246d2a3c5d49d4ae4988172e7b22eaf86a8"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlShowColumnOutpuVisitor.visit (cyclomatic 22): MySqlShowColumnOutpuVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlShowColumnOutpuVisitor.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"52df3045a8307a9cb918dc86dad436f794e5f3c206f295a8adadb59d3eeb6dcc"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsStatementParser.parseInsert (cyclomatic 22): OdpsStatementParser.parseInsert 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2e695309bee9f0243ea479550209231153939312ddd2e5a0ac7c5ae9c98399"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseCreateType (cyclomatic 22): OracleStatementParser.parseCreateType 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":3061}}}],"partialFingerprints":{"codehealthFindingId/v1":"716b9cd96f35bb574818753a4f13fe93545afd76ee81c4aeac48ac0b71cd689b"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 22): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b9b985f551c8dcba4c5309ea5a6bb79f6ff029f37127400a5b9db1d15978d1"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarStatementParser.parseInsert (cyclomatic 22): OscarStatementParser.parseInsert 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"73404c6f3e4a02f79c63f9a4fb41a41c31dacc136aa371a7892803720a864946"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 22): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f01301ce7422c44be7b488617fdc24d5d8f8cd5ea3ccb79986181330a84514"}},{"ruleId":"D1","level":"warning","message":{"text":"StarRocksOutputVisitor.visit (cyclomatic 22): StarRocksOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b51b6111164a3fdaf09c4317de4cad5057686b11696e98b9c4bbfe88ab7712"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseTableSourceSampleHive (cyclomatic 22): SQLSelectParser.parseTableSourceSampleHive 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"357ff8f973b1cd3601b327dd597f4039e0a1630dbe1d5a1edfc969dc7992618b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.alterMaterialized (cyclomatic 22): SQLStatementParser.alterMaterialized 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7587}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd41d25845519d14ec887725a9b1a9e27aec5cacc68129860b9ba5637c20f3ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ParameterizedOutputVisitorUtils.parameterize (cyclomatic 22): ParameterizedOutputVisitorUtils.parameterize 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":"core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd8acc2c8cd2b1f313c2a8eb98006b3f7125fcb42ffc5cb03a07670e22cbc1"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printInteger (cyclomatic 22): SQLASTOutputVisitor.printInteger 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45f8ed9a1f88dacdcb7f457ef8c486e5ddd9c4a3ee6454d053ef9a0356e24f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printMethodParameters (cyclomatic 22): SQLASTOutputVisitor.printMethodParameters 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"be079ba58afc1ca6a3d74491db6217021269b60339452c7fc2eaae0dbaff5d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 22): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44afb3d93a269dea1e885e92925e8f2ad12e6c93f898ee72c98633b582f98eb"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 22): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabe4a1eb729c40941303a4cff48028a581b84951f8b1fb90fad438388f13627"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 22): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b858c7cbc24a1d4f9fefc7232a91bcef483af8a04bf70b58e747e13d72511a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.lt (cyclomatic 22): SQLEvalVisitorUtils.lt 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a20c91558147f1df7b9cac836f750595f1cfa981b0f3f1a83cd49e32522ce89"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.check (cyclomatic 22): WallVisitorUtils.check 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"432029e0d8f7e201a52f1061fed259b54b4cf0a71fbf9a44b7601846ed05d0ce"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.checkSchema (cyclomatic 22): WallVisitorUtils.checkSchema 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfb7cf836ca7063833586d742164d4c45bcdc59b90c28de9b119c9bb17d5268"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.checkSelectForMultiTenant (cyclomatic 22): WallVisitorUtils.checkSelectForMultiTenant 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f681906d9652674f75beb45a32dfaf4907983a87d4236d0ca41be0180ecbed"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.initExceptionSorter (cyclomatic 21): DruidDataSource.initExceptionSorter 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f449b0507e94574b44fa60e43b2dca4aa0282a85234bb97c7e3860eb85266f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLPropertyExpr.computeDataType (cyclomatic 21): SQLPropertyExpr.computeDataType 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLPropertyExpr.java"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe55be9c8c3ccf77c8e3be81a5a228805e9d97ad4da1c24fd3568324462bf177"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLCreateTableStatement.cloneTo (cyclomatic 21): SQLCreateTableStatement.cloneTo has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b08a523d19f0b595e658aecd33b245451889e7cbd56b8aa801d1b34998d1f3"}},{"ruleId":"D1","level":"warning","message":{"text":"BigQueryOutputVisitor.visit (cyclomatic 21): BigQueryOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdb13fed5efc309d2fc921c80a87731845438900bbf14e409616525a7b25d76"}},{"ruleId":"D1","level":"warning","message":{"text":"BlinkCreateTableParser.parseCreateTable (cyclomatic 21): BlinkCreateTableParser.parseCreateTable 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":"core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb4237330785d2614942d99d28bb27ff7291dbb1487ce1b87f501bda3942601"}},{"ruleId":"D1","level":"warning","message":{"text":"CKOutputVisitor.visit (cyclomatic 21): CKOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea60b54df5a28d127a48c5b8e7c7ead23bc346781c4729a83c69a1559940db9a"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlCreateTableParser.parseConstraint (cyclomatic 21): MySqlCreateTableParser.parseConstraint 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27b3c7e0072becea666d9a0823e37a32ff60ace0c247bd1397684497361f543"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseCreateTableSpace (cyclomatic 21): MySqlStatementParser.parseCreateTableSpace 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebde92ce7ab89b90d792e2509b20a6e3a7602a911d4b3bcdbf42bb38f14df3fb"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseReplace (cyclomatic 21): MySqlStatementParser.parseReplace 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4135}}}],"partialFingerprints":{"codehealthFindingId/v1":"55daa08476958aaebce9eb41b7cf2527e4d26e819b83f47cb656744ee375277c"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolveVisitor.visit (cyclomatic 21): NameResolveVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/transform/NameResolveVisitor.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c299f59cd041c16deb49f846d1620c917df1954c45bc8b04de5683d91e714886"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 21): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95e1d85321ee47e72a6ebe593d8ef403ad6b0bae217014c493e93ef3a837da3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 21): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4663}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b8bce244098d8915e727289d8f968143e82fc910d0229b442886a16c903909"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleCreateTableParser.parseOrganization (cyclomatic 21): OracleCreateTableParser.parseOrganization 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"527cc74c540123a1723256bc2e1d1667e6de95ddd2a37f04ffd6a0dbe6e254e7"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLServerStatementParser.parseStatementListDialect (cyclomatic 21): SQLServerStatementParser.parseStatementListDialect 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31ed632f96ddb0b47c660b01811f96ba28ec60a24b83f7d64a8bb05ddd76fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cyclomatic 21): SQLServerOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1706ab9a6b50a857caa15f600c1572b82026356b40b9e414479e2b4ab0d9cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.andRest (cyclomatic 21): SQLExprParser.andRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087dc7804c8df1479264eaa48f65990b4462df98f8d1b9fdbfcbfd65bc2d1b4"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParserUtils.getTables (cyclomatic 21): SQLParserUtils.getTables 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be0222c2d4002a81f960f164b2a42370d5a89341503905174c0ce73a3a44b22"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseDropTable (cyclomatic 21): SQLStatementParser.parseDropTable 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f2c11d19b5e2b114a421abd219e25a3a8cfbdfb09666bcfc2d7e913de54309"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseHiveCreateFunction (cyclomatic 21): SQLStatementParser.parseHiveCreateFunction has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7701}}}],"partialFingerprints":{"codehealthFindingId/v1":"44abb17da762bd64386399abbf1cd6b48f30bad2b2f0d22e593daf5f566e1383"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseWithQuery (cyclomatic 21): SQLStatementParser.parseWithQuery 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b64a28169cc2b9ea457b541b877bf7095e568310e3168fa0cbe124eb22de058"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printMethodParameters (cyclomatic 21): SQLASTOutputVisitor.printMethodParameters 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"411343e3bd24adbc25f9eecc83d2b05f7698e33b1eb9255a1249a1ca7fe82876"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 21): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0434764e64ec59076d6206eb308e50e65f1dc5668b0f82c6043dc840aeb6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 21): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10884}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec66d7fc5ae0137ca698fdc9a41fe5eba1a9b19aa4f0dda68c00eac567874ac"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 21): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6190}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ea101259e0cfcd2d318a6fef10353100c4e2f7c8e0c39f47538d19b48c85d0"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.type (cyclomatic 21): SQLEvalVisitorUtils.type 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b0388f0439a7181b8b7bb78d49626969be1e96544352d64a09c4eba516c504"}},{"ruleId":"D1","level":"warning","message":{"text":"WebStatFilter.init (cyclomatic 21): WebStatFilter.init has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/WebStatFilter.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4456e4d4572cbc3faa1f54230de33c12daeb9f58ce5b97d307e011d1354884cd"}},{"ruleId":"D1","level":"warning","message":{"text":"WebStatFilter.init (cyclomatic 21): WebStatFilter.init has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/jakarta/WebStatFilter.java"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffe712dc6c41e94eb16eb445d72db63d79abb6e11d6a6544b6eecf0b5487a41"}},{"ruleId":"D1","level":"warning","message":{"text":"JSONWriter.writeObject (cyclomatic 21): JSONWriter.writeObject has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/json/JSONWriter.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ff9ee14e8362b0a22c48f0a9323b5d4846e0ab041a3524a6f0d5b49ea5c0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlTypeUDF.getSqlType (cyclomatic 21): SqlTypeUDF.getSqlType has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlTypeUDF.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c783a71e392d4712243c08b4704c727dc171be416bf9418e35c63ec41df72752"}},{"ruleId":"D1","level":"warning","message":{"text":"WallFilter.preprocessResultSet (cyclomatic 21): WallFilter.preprocessResultSet 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":"core/src/main/java/com/alibaba/druid/wall/WallFilter.java"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"650c18d3ef16e781401a0500c67dd8968a274a557ca1623e37f1539b16fa39ae"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.getConnectionDirect (cyclomatic 20): DruidDataSource.getConnectionDirect 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3031afd7b22fec724aa18529040ed2200f62bebd72983bfb58e0eff4656be6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.acceptChild (cyclomatic 20): SQLSelectQueryBlock.acceptChild 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c6bf0627e3b2f9440556d752bddb098193def9a7b7042a9ba16161b7f69f6a"}},{"ruleId":"D1","level":"warning","message":{"text":"AthenaCreateTableParser.parseCreateTableRest (cyclomatic 20): AthenaCreateTableParser.parseCreateTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06acad020bf0a41956163b9ec3aafd81354efa70218c7732a0d16432e4efb03"}},{"ruleId":"D1","level":"warning","message":{"text":"CKCreateTableParser.parseCreateTableRest (cyclomatic 20): CKCreateTableParser.parseCreateTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKCreateTableParser.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71aa47a148d36d65591ceb9038bb3a5f8b4d7ae3ae58a3c5a34f9f08e6abf6c"}},{"ruleId":"D1","level":"warning","message":{"text":"DmExprParser.parseInterval (cyclomatic 20): DmExprParser.parseInterval 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49163dc77355d1e60c5aa5bcdc022e41ed546148293611dde4e492969e0af9e"}},{"ruleId":"D1","level":"warning","message":{"text":"DorisOutputVisitor.visit (cyclomatic 20): DorisOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7262d9e7402764ecb234554b67cea936d7f0791f6df5cae1b019f3a4cd8d1150"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parseAssignItem (cyclomatic 20): MySqlExprParser.parseAssignItem 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f055f642f4b9c330c03c55e0c41ed208485d25fddf303f26610aa0d9710d77"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlSelectIntoParser.query (cyclomatic 20): MySqlSelectIntoParser.query 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"870c5b8294bc404a6a0739cf7e52b95f37348fa0a6c2cc521dcd873d52e531ce"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 20): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f91d151274a3ff645c461cd8599187c7631d755c2f27fa52f4d431b67115ea7"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 20): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4040}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b8ee10a2af5c8fa10deb5eb6cec7042fc8e491dd948cd7120942be2f5c70c5"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 20): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8e84d835e2b2c70ac3b28a1c4363e941d57097b151ce5f90a67fcabcc617cb"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsExprParser.parseSelectItem (cyclomatic 20): OdpsExprParser.parseSelectItem 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"936e4be44f0502668b76b8ddd809a1c075d343c8ff8e843a91eef9ab43842ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cyclomatic 20): OdpsOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede393c9c397fc2fcb37ccbbc6cd614467fb34223a6faad32198cde01a3c128a"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleLexer.scanNumber (cyclomatic 20): OracleLexer.scanNumber 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe3098f1836cdbd63a66f7b3e30a6fd9413adeaa490d304837fe50a7298f353"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleLexer.scanVariable (cyclomatic 20): OracleLexer.scanVariable 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d3cae9e99b2c86bf52558dff9beb1a7128f8372521dbebcc5ff4e3ca2ec4b7"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseCreatePackage (cyclomatic 20): OracleStatementParser.parseCreatePackage 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cc71baed5d2cbf7509e9b98bd15c9eb6fc4f88de0181713498a93722381923"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleRowNumToLimit.visit (cyclomatic 20): OracleRowNumToLimit.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"548031ef505ee5f748dc68af99bece442068e39e5ea6e86356dfcacc1e8cca97"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarExprParser.parseInterval (cyclomatic 20): OscarExprParser.parseInterval 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d938576c5b6a20239a2fd40aa519d78187d4b877c29ba887925f01acefa69c2"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarLexer.scanString (cyclomatic 20): OscarLexer.scanString 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarLexer.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d4b4c5ef5a8357d9b36066b1481966557d109e092c837d185f3f6f28b4c2da"}},{"ruleId":"D1","level":"warning","message":{"text":"PGLexer.scanString (cyclomatic 20): PGLexer.scanString 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGLexer.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b2cee6b0d1ddc7d1d5678bbacd8b5f4549fce590fb507e5661758e0d6a7646"}},{"ruleId":"D1","level":"warning","message":{"text":"RedshiftOutputVisitor.visit (cyclomatic 20): RedshiftOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/visitor/RedshiftOutputVisitor.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"931231b0e598e6785e66045237a8ac0fcce1c0312c6db394c57bcc08c62ab898"}},{"ruleId":"D1","level":"warning","message":{"text":"SnowflakeCreateTableParser.parseCreateTableRest (cyclomatic 20): SnowflakeCreateTableParser.parseCreateTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeCreateTableParser.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2661e9b9d962576840a8054becebc897bfa5c1a9cd2b7b31e09569d986241c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLServerStatementParser.parseSet (cyclomatic 20): SQLServerStatementParser.parseSet 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7f562aa13ce1cc356a9c95d0f6110cc8ad90102f9075ca32bfbf848c93d660"}},{"ruleId":"D1","level":"warning","message":{"text":"TDOutputVisitor.printSqlSetQuantifier (cyclomatic 20): TDOutputVisitor.printSqlSetQuantifier 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":"core/src/main/java/com/alibaba/druid/sql/dialect/teradata/visitor/TDOutputVisitor.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db3714534e89ecbf9459220285bfe705125a7d1a345c23be3afa78533a6aa06"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseInsert0 (cyclomatic 20): SQLStatementParser.parseInsert0 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83720d2e2d9dd6822f4ecaf181b78da88bf6fd6bdbe124b5fbe3e63ae4dd447"}},{"ruleId":"D1","level":"warning","message":{"text":"Substring.eval (cyclomatic 20): Substring.eval 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":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Substring.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2ef9dbcb0bad54f757020aac6d021fea885a17ba63fd292c450d8fc987bbe3"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 20): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5516}}}],"partialFingerprints":{"codehealthFindingId/v1":"b299ba7a22c70564cabe57151d15ebccaa730689e1e0739529c49ece1407f1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLUtils._normalize (cyclomatic 20): SQLUtils._normalize 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":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"323cdaea93cb6baead7bd916f487429b092e9550255b2879c698b30cce3c2013"}},{"ruleId":"D1","level":"warning","message":{"text":"WebStatFilter.doFilter (cyclomatic 20): WebStatFilter.doFilter 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":"core/src/main/java/com/alibaba/druid/support/http/WebStatFilter.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbebfe6eb9be3fb605dc6a50367b0f50f32ba1ff8c5af1ad82c642da66572be"}},{"ruleId":"D1","level":"warning","message":{"text":"WebStatFilter.doFilter (cyclomatic 20): WebStatFilter.doFilter 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":"core/src/main/java/com/alibaba/druid/support/jakarta/WebStatFilter.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc869218306e0f1fa296c258c6f9961278bad87f6994e119ef0d36ee4585bb6e"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.checkInsertForMultiTenant (cyclomatic 20): WallVisitorUtils.checkInsertForMultiTenant 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"14efa959cfc2332821cf77e5e53afba1204ba03bfcaae197f02bd6c9cd4a171c"}},{"ruleId":"D1","level":"warning","message":{"text":"MonitorStatService.service (cyclomatic 20): MonitorStatService.service 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":"druid-admin/src/main/java/com/alibaba/druid/admin/service/MonitorStatService.java"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a573cff40952db46d38779ffa204667a7dff1b1367d2a701005468e3f82e164"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidConnectionHolder.\u003Cinit\u003E (cyclomatic 19): DruidConnectionHolder.\u003Cinit\u003E 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":"core/src/main/java/com/alibaba/druid/pool/DruidConnectionHolder.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"516d46458070a7820dc0035a059bc4ba6f860065b6a4248c2bcb471c192f3370"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLDateTimeExpr.check (cyclomatic 19): SQLDateTimeExpr.check has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateTimeExpr.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"364a3c1941385f0698fd78504c2b85d01b8498baff688284380866ccf4bbc815"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLTimeExpr.check (cyclomatic 19): SQLTimeExpr.check has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimeExpr.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a091a87c800f0ac9f7f0aa8d227db60252192656e5b5c59840717b4bcc6a961"}},{"ruleId":"D1","level":"warning","message":{"text":"GaussDbCreateTableParser.parseCreateTableRest (cyclomatic 19): GaussDbCreateTableParser.parseCreateTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d31490b4f0ea54cfd91c584fb59bdb6b0267917fbcf4e95e22805a308c1cb13"}},{"ruleId":"D1","level":"warning","message":{"text":"GaussDbOutputVisitor.visit (cyclomatic 19): GaussDbOutputVisitor.visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dd32cd4f2961285bba0a5f1c0e7d8fbdcd6ff50535c17a13644d7b3680ccb5"}},{"ruleId":"D1","level":"warning","message":{"text":"GaussDbOutputVisitor.visit (cyclomatic 19): GaussDbOutputVisitor.visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e361a6fd490988d64fe60438fea9646740735ad480102f76ce1daeee08063c"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.parseSubPartition (cyclomatic 19): MySqlExprParser.parseSubPartition 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"87eeabc50f5bb1e91854c1f61a621ebf12049defe8684b2e475aa7aa51539d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 19): MySqlOutputVisitor.visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2f70963c8dd5bce5a33a098f2dfce9c0b7325be13b2cc53d261d08e2e80183"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsStatementParser.parseGrant (cyclomatic 19): OdpsStatementParser.parseGrant 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bbf1b52374255f4a1fa53c9647237e102b42efdde68cc170e73372f0d59417"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.printOnConflict (cyclomatic 19): PGOutputVisitor.printOnConflict 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a0ff9cb87ef08f0c7f8fbe0c648c9aa8153e92a7d11c1534680b7e9b4ae2b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanString2 (cyclomatic 19): Lexer.scanString2 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9edfa34c9d84af2ede1452edbe967b2c32e818d311a192b10f4c03c38d7ff5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanString2PutEscapedChar (cyclomatic 19): Lexer.scanString2PutEscapedChar 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5ca7df5195236ea5689e31df895771c5b403ac2543a06d0738852aba6a52fb"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.dotRest (cyclomatic 19): SQLExprParser.dotRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266dfe428aa4a44c58c838d3a2180aee730b83c3fb8c0e6abb43bcaa3da9cf5"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseAlter (cyclomatic 19): SQLStatementParser.parseAlter 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"645d68b014bf9c4bb2a366fb158abef4bcd991da7fdb75e865fd3e9665a5ff9b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseCreateTrigger (cyclomatic 19): SQLStatementParser.parseCreateTrigger 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4550c108b8d55473e04642d43e662dbcf0a6ef5840a545f00eb94984151d9b8"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseDescribe (cyclomatic 19): SQLStatementParser.parseDescribe 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"3101c84363efb6a0cfd69fe7fa98aa3b9774c755bfa07784824071e6fa08fd65"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printOracleSegmentAttributes (cyclomatic 19): SQLASTOutputVisitor.printOracleSegmentAttributes 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9083}}}],"partialFingerprints":{"codehealthFindingId/v1":"692f8e27065ac7cca7f88612b9c5cc40e1682c5096968a8a1965fd740a64de05"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 19): SQLASTOutputVisitor.visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e896e9901430508b44a7fcd868fe2fe4d5ab4c3edd73914736ff0ff61e774bf"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 19): SQLASTOutputVisitor.visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6cc4dbe508357a03da5368ba6244a4923842f7d00421e6681d3e240cf51c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 19): SQLASTOutputVisitor.visit has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27086454cc037722be0febbc0922669b5e27d273970fe4ef28a601b33e7d420"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 19): SQLASTOutputVisitor.visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5aed79864fda584e8b013845a68ed6ff2e7acddfe753d8675d2ed85d7ad233"}},{"ruleId":"D1","level":"warning","message":{"text":"StatViewFilter.init (cyclomatic 19): StatViewFilter.init 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":"core/src/main/java/com/alibaba/druid/support/http/StatViewFilter.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"484bce631ff1af05120cd31ccab77af9d27d018ea9ef45471da1e6f6a85dff38"}},{"ruleId":"D1","level":"warning","message":{"text":"StatViewFilter.init (cyclomatic 19): StatViewFilter.init 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":"core/src/main/java/com/alibaba/druid/support/jakarta/StatViewFilter.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"19824dfc81c4e7edbb6e03e4486cc7614c7e41ee4f240e2e72d50121f57e7f70"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeStatVisitor.preVisit (cyclomatic 19): CodeStatVisitor.preVisit 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":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlCodeStat.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2814a34a811bba49c2467f68f1211c8e8511125c0db3c134f8c1f856cb1dfc"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.checkConditionForMultiTenant (cyclomatic 19): WallVisitorUtils.checkConditionForMultiTenant 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce77852f8f11c8b2774913e79be01cc0d1772ea830ae450dbe6ab793778c40c9"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidAbstractDataSource.testConnectionInternal (cyclomatic 18): DruidAbstractDataSource.testConnectionInternal 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"1405acec3969809305d5f2b3106cfb2b69cd46261dcebd082491e92b2b132cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidAbstractDataSource.validateConnection (cyclomatic 18): DruidAbstractDataSource.validateConnection 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8e65792f289d11ec804e793a54ae0468991fdfb1fb828d4d6a00738852e47a"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSource.handleFatalError (cyclomatic 18): DruidDataSource.handleFatalError 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b38b02068bc6aab7bd45b20a5f8a05597b7ac707b1a388524603ffc1cd6be4b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLJoinTableSource.equals (cyclomatic 18): SQLJoinTableSource.equals 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLJoinTableSource.java"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f749d4ba6a37a794def1b6a1c065fc082850c45d4598344a0b33c4f56d18e8"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveOutputVisitor.visit (cyclomatic 18): HiveOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ceb07d9ff6db616ec6c79e5d7e64c84956a42f00945071050aa283e5cb8d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.createTableRest (cyclomatic 18): MySqlStatementParser.createTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2621d2e3516d32682733cbd16fea8c98c4f90f693eef7bed1d04116f4af9d793"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseAnalyze (cyclomatic 18): MySqlStatementParser.parseAnalyze 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f303b9f0ae8690599d586fa62545f00d7cb5874083985544513055cbee6ce0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseCreateUser (cyclomatic 18): MySqlStatementParser.parseCreateUser 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c1a522e33c9487d2792cda7beb7a4cfcd67ee6cab3bf81cf5ba91efdfb1253"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 18): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2343cdd0a24b9d692d9b8ea3bf94056e187ddfa7c258abaedec71c3c7d4baec"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 18): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"04309edef335c86e087be2ea432b21ffa67702e9e11c74da6ebbdba5ecda7697"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cyclomatic 18): OdpsOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e10e843ecea8ac1ecc112bf898c14472bd794ff5308588fc87653029572774b"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleIntervalExpr.equals (cyclomatic 18): OracleIntervalExpr.equals 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/expr/OracleIntervalExpr.java"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"933d11dc96c39a61d46b452f8927b406af96a3ed7f4432baccb5e3ec33f9258e"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleUpdateStatement.equals (cyclomatic 18): OracleUpdateStatement.equals 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleUpdateStatement.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce713e2c398d3dc1609dea259e25beac7b1948128e33881fe69cee1e9db4179a"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.parseStorage (cyclomatic 18): OracleExprParser.parseStorage 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fa46b6b4546216a6336170f74afb236d0cf7a411a3d114461563c205e72758"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 18): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38fd41d41f5daeb1ae102c318329006871577984d6e79068d0a2e3ffa432c67"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 18): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2950}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c0eb3a492917231800be63fddd1146235c002c4bc4d480f9b812aabdd497c7"}},{"ruleId":"D1","level":"warning","message":{"text":"PrestoSelectParser.query (cyclomatic 18): PrestoSelectParser.query 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":"core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoSelectParser.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12549d775c202230303858cbdd842ed950b834c36d2f5c15f9a2b83490f2be7"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cyclomatic 18): SQLServerOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79b727dc6bcd6f3e95a40397c17e9a4399648daae016074b2119afcf359522a"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanMultiLineComment (cyclomatic 18): Lexer.scanMultiLineComment 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"858e63c948965808456809dd4d3820b0ba3ed540575c8146f5e1ca7f4d0617a7"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseRevoke (cyclomatic 18): SQLStatementParser.parseRevoke 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab76917b8e3365217add51758db456a3fa774c249232111539b19be9cd735a5"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printFetchFirst (cyclomatic 18): SQLASTOutputVisitor.printFetchFirst 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1c478219dc557c3c0bc88d3eac06058ec84334c5b300b90e2979dd46699a38"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visitorBinaryRight (cyclomatic 18): SQLASTOutputVisitor.visitorBinaryRight 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f7e5cfc281e75c6101639495676e92f4c36aa16fa48fb8ca0aef836e3ae1ff"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.isFirstSelectTableSource (cyclomatic 18): WallVisitorUtils.isFirstSelectTableSource 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"857f73f1c3593fc51fd66fd570f7bc585b1254e0783d382b564135f34b319403"}},{"ruleId":"D1","level":"warning","message":{"text":"StatFilter.buildSlowParameters (cyclomatic 17): StatFilter.buildSlowParameters 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":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9618c1bc1a7d062fd066aa16f406f2adbe88b42fb6cf55d1c0542e436188052"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLAggregateExpr.equals (cyclomatic 17): SQLAggregateExpr.equals 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae50dc549f1daa5cadf74f1a2b03c4d75c9b25cc6ac6cc3bacb4900bbdeacf8e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.addWhere (cyclomatic 17): SQLSelectQueryBlock.addWhere 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"515d44c964279b11b8f1fca450ce306d791588d1189e663479ce0382ceaa7921"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.replace (cyclomatic 17): SQLSelectQueryBlock.replace 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d90f6c72fb1a0a93a3f4b33f2655e9f1d8cf1f97680540d1a8f3abb9b59167"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLIndexDefinition.cloneTo (cyclomatic 17): SQLIndexDefinition.cloneTo 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":"core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexDefinition.java"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c425e25ede5b6b6a66a29e0da80365cb1c43d6f7a708a4a5851b42c0573d44b5"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLOver.equals (cyclomatic 17): SQLOver.equals 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":"core/src/main/java/com/alibaba/druid/sql/ast/SQLOver.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5db6c0644b52eb34a14c03a8f52068e1a181f52c5f0c11cbf49546467fad3f"}},{"ruleId":"D1","level":"warning","message":{"text":"CKOutputVisitor.printComment (cyclomatic 17): CKOutputVisitor.printComment 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":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd099decfc476ffea24538465eec08fcab9e62f5e0d421112146a4eb188eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"HologresOutputVisitor.printComment (cyclomatic 17): HologresOutputVisitor.printComment 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hologres/visitor/HologresOutputVisitor.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"781829c4c38069a881cf35bd0bd0ac96a943796b335c5a070b04005ce165386c"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlCreateTableStatement.cloneTo (cyclomatic 17): MySqlCreateTableStatement.cloneTo 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d609e9e609e1648b7cececab6b53e418de7872422fd8033fae14da3e8ddb9a22"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.alterDatabase (cyclomatic 17): MySqlStatementParser.alterDatabase 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8052}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad56d215acfce2ed444236a8e00be8c4ce541fe8bfc1d6e33f6ad89cd6eaad9"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 17): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95c9ef62dae0b59cdb7a01c623b89e59d6b529ddb36d59b2dc2a783311edca2"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 17): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4973}}}],"partialFingerprints":{"codehealthFindingId/v1":"838e8e8e803c310962c5c5159a4bb9fc3078f5b3c9702aeea86cfc5cf6b06fee"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.parseLobStorage (cyclomatic 17): OracleExprParser.parseLobStorage 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0d9e9219c19e51abaae39ca339072a543929e3c23845e1cfe1288a33032785"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 17): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d2808b2b97a80d14a7bc1e9c05bd311cd0dab068e44b81f2895af8fa16f6b9"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 17): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cafa7e2e95e307749b46217f79f3f2d6a8b007d88f76b356219ed9bf0a1806"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 17): OscarOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"283147311914fac3f8dbcd6c94fc957471b52bd985001aa90ff01dae4bb55303"}},{"ruleId":"D1","level":"warning","message":{"text":"PGSQLStatementParser.parseBlock (cyclomatic 17): PGSQLStatementParser.parseBlock 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d468a7d1677aab6a7e4e24577b435517d699d12a1e4c7bb2bd340fc7186b3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"PGSQLStatementParser.parseCreateIndex (cyclomatic 17): PGSQLStatementParser.parseCreateIndex 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50e063d8645bc429140571119296dd1df6862c6012f7e583fd426b4097239db"}},{"ruleId":"D1","level":"warning","message":{"text":"PGSQLStatementParser.parseSet (cyclomatic 17): PGSQLStatementParser.parseSet 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"a870b5d8983abe7bf8d65fd2c688c32dfb41e8fa62b55f25461b42877b74244a"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 17): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ec2e262c66a9111decd396005dbe2db9237cdb28ce1cea0638d578e2310ea6"}},{"ruleId":"D1","level":"warning","message":{"text":"RedshiftCreateTableParser.parseCreateTableRest (cyclomatic 17): RedshiftCreateTableParser.parseCreateTableRest 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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/parser/RedshiftCreateTableParser.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22945931e034900e0beef2c6467289c5fa5d6adeff9b1e761e8ff7d9194c143"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLServerStatementParser.parseInsert0 (cyclomatic 17): SQLServerStatementParser.parseInsert0 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aa940168307f5e35e85399f8238cd05da62a9a8c2f099c41ccf27f55610928"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.parameterize (cyclomatic 17): Lexer.parameterize 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6158f0395ec75efce102b550c4932047f3260af28bc56ea4d05d85af884501cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLParser.tableAliasFromRequiredRest (cyclomatic 17): SQLParser.tableAliasFromRequiredRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f5b290e739c0dbcf382579561fb34ca7704dec175f4fc13921c2a78370895b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseGroupByItem (cyclomatic 17): SQLSelectParser.parseGroupByItem 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec92778cdda9ef0212854d9de6485dbc0d97e5a893607e9e8dcbde63477af05c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parsePivot (cyclomatic 17): SQLSelectParser.parsePivot 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d28922dd125ada8616b2d3baa11721ee6165f80e5a44790af886c45a28514b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseSelectList (cyclomatic 17): SQLSelectParser.parseSelectList 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbf2d697280d9fa598da97cfff7d719816a77142f4880fe335e9226ace6ccce"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cyclomatic 17): SchemaResolveVisitorFactory.resolve 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"59966c9515737351e4a06f944336e812e335228bca522fef665e788ebd8d517d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.hiveVisit (cyclomatic 17): SQLASTOutputVisitor.hiveVisit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9956}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d3eb4d1a29f9ff02123c691eae3d5f7ae6cb78160d28b2e6947a46a2dc567"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printSelectList (cyclomatic 17): SQLASTOutputVisitor.printSelectList 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab47310f81d4af46bd4eef2717c0116ecb064e2435f1f0a7c854df63f00b1b32"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 17): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7978}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb3b926352e0032dc71ea86b003d9b743d535bc51c08749512afa0f88ac9346"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 17): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa12d1481e3ac973256472c3110da2b2037aa6f02c9083fa46dbba87296f27d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visitStatementList (cyclomatic 17): SQLASTOutputVisitor.visitStatementList 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11950}}}],"partialFingerprints":{"codehealthFindingId/v1":"991dcac8d871ddf130cf91beb689acc11ab9bc12a4cb86f2e8755c615e3ae760"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLEvalVisitorUtils.like (cyclomatic 17): SQLEvalVisitorUtils.like 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be79145d511d3c0e3828207eacb792d3a89db20933c04c5de17e9978155c7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleUnorderedLimitDetectVisitor.visit (cyclomatic 17): OracleUnorderedLimitDetectVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a39f22f4b5219dcb7ae63b5af0872c196393a651934b35c13270bbf373e5405"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLUtils.toSQLString (cyclomatic 17): SQLUtils.toSQLString 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":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"943690045d7eb3f59c074eccb923824d5851bb6992281caea237d8231fd83c91"}},{"ruleId":"D1","level":"warning","message":{"text":"WebAppStat.computeUserAgentAndroid (cyclomatic 17): WebAppStat.computeUserAgentAndroid 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":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStat.java"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5661fb274b5d1a49e44940f89756e0e25a6a80deeb929e762e669ebb4c1fa5"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceHandler.service (cyclomatic 17): ResourceHandler.service 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":"core/src/main/java/com/alibaba/druid/support/http/ResourceServlet.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"83098b92fd0637656cc4e8cbe205e6c56e89b1587ee5604b02dad6842813da19"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceHandler.service (cyclomatic 17): ResourceHandler.service 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":"core/src/main/java/com/alibaba/druid/support/jakarta/ResourceServlet.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d92921d7506cd7be6ba080c8041bbecf4863414cc5614034b47e0dec9629cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"JSONParser.nextToken (cyclomatic 17): JSONParser.nextToken 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":"core/src/main/java/com/alibaba/druid/support/json/JSONParser.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d3f9a009d18f8c6f5f0f591d814244958db380ef9d0c57b2549c5fc0a206dc"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidDataSourceUtils.configFromProperties (cyclomatic 17): DruidDataSourceUtils.configFromProperties 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":"core/src/main/java/com/alibaba/druid/util/DruidDataSourceUtils.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d171013640adfe11bc89046e5f538a4c4f424959261ecd151ce05c5dee4a329f"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidWebUtils.getRemoteAddr (cyclomatic 17): DruidWebUtils.getRemoteAddr 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":"core/src/main/java/com/alibaba/druid/util/DruidWebUtils.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4060b27365b9bd927d749cd2d618235a18ba3e48e983ff56fb43a5f1bcc77219"}},{"ruleId":"D1","level":"warning","message":{"text":"DruidWebUtils.getRemoteAddr (cyclomatic 17): DruidWebUtils.getRemoteAddr 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":"core/src/main/java/com/alibaba/druid/util/DruidWebUtils.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b69d7c533a73068f7819d33ed53eeb67cae587dbf8dbd7de6af5bd11083def"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlUtils.isNumber (cyclomatic 17): MySqlUtils.isNumber 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":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec94610bf8d4ad0904ad606026a761b4060e6c8b1a534f150906f67d0cfb7d7f"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.isSimpleConstExpr (cyclomatic 17): WallVisitorUtils.isSimpleConstExpr 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9f96b68ca5273ebc280d1b9b39e5fab2aa2ce1c2fe42efc83dd6d56f6bbaf3"}},{"ruleId":"D1","level":"warning","message":{"text":"WallVisitorUtils.isWhereOrHaving (cyclomatic 17): WallVisitorUtils.isWhereOrHaving 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1ac801a27c1a36fbb42560c2ecf874bb5a07e1d91d450e1cfeb5026fcdbf32"}},{"ruleId":"D1","level":"warning","message":{"text":"LogFilter.configFromProperties (cyclomatic 16): LogFilter.configFromProperties 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":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81d15b33216e9cc282ddd99bfd09c51466275619d42a4d473e3808f83c676ad"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLBinaryOpExpr.merge (cyclomatic 16): SQLBinaryOpExpr.merge 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a818e24baa77d2945ac9b55a22fa1df9eac9115742dcd032de1f6f4320c169b"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectQueryBlock.addWhereForDynamicFilter (cyclomatic 16): SQLSelectQueryBlock.addWhereForDynamicFilter 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"027109a61e55cffad8e79ba0652b07825edb4ba7b21df473c71137d19b3de30a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLUpdateStatement.equals (cyclomatic 16): SQLUpdateStatement.equals 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dbbd3b156b831bb9c876c0ad10c294ff5326bf9b32e6b8b2df0722c78c8178"}},{"ruleId":"D1","level":"warning","message":{"text":"BigQueryStatementParser.parseCreateFunction (cyclomatic 16): BigQueryStatementParser.parseCreateFunction 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryStatementParser.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbc74a2e8b24bd6c416e1e268f7a44d73b6664579608303cdf265613ab34bc6"}},{"ruleId":"D1","level":"warning","message":{"text":"DB2ExprParser.parseIdentity (cyclomatic 16): DB2ExprParser.parseIdentity 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b818a713a7838a4659cb4bb3a6d4293f68e8b1b6d18a5108c55a2dd3a48b4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"DmOutputVisitor.visit (cyclomatic 16): DmOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d24971c285f79d51489d7c823ba3d05f20a9a5a8118f9a61c8d51e67f79b4e"}},{"ruleId":"D1","level":"warning","message":{"text":"GaussDbExprParser.parsePartitionValues (cyclomatic 16): GaussDbExprParser.parsePartitionValues 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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bad075643204528a2085f341769fe8310dc99fafe2951fac88054e1be42731"}},{"ruleId":"D1","level":"warning","message":{"text":"H2ExprParser.parseIdentity0 (cyclomatic 16): H2ExprParser.parseIdentity0 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":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2ExprParser.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7621f5d144e2b30a64104c0814a0c1f29c4446627693b72d4ac3883e5fed78ec"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveOutputVisitor.visit (cyclomatic 16): HiveOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7a064142001ecdaa2b5a1bab8880e1e2d2bd8a47d60a9b15a7d01a94531fb3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlExprParser.\u003Cinit\u003E (cyclomatic 16): MySqlExprParser.\u003Cinit\u003E 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"121959bdff249887b1e9be96cf6f1329462d3e58b68b75b74775c170984c8bc9"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlStatementParser.parseCreateEvent (cyclomatic 16): MySqlStatementParser.parseCreateEvent 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5570}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb772e2b3ec5af7ff081ecab54f10851e299abebfecbf26bac7f2f51538428a7"}},{"ruleId":"D1","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cyclomatic 16): MySqlOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"489960533943851da5c268482f55e79a323c89a28b902052b33769361c0f5cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cyclomatic 16): OdpsOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a1dfe38cb1b3fc39282cdf51a50166d4b28dba20d617576eb7ed8155a7e0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cyclomatic 16): OdpsOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd3e2619cf3a3935410a27b511273a09a4d2dd5fa2922262b022344eb796366"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleCreateTableParser.parseCreateTableSupplementalLoggingProps (cyclomatic 16): OracleCreateTableParser.parseCreateTableSupplementalLoggingProps 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf91b2414eb911b411a93013ceb49ffb9124117551de804ba358e49d63e5bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleExprParser.parsePartition (cyclomatic 16): OracleExprParser.parsePartition 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0383942f8a41e06a860b105333581194fb11d915a4923099daaf9654fcf232b"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseAlterTableSplit (cyclomatic 16): OracleStatementParser.parseAlterTableSplit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"227bb274cb1dfb96af88125fbc4067a720178890556e47acd115c3657fe83f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleStatementParser.parseCreateSequence (cyclomatic 16): OracleStatementParser.parseCreateSequence 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0be2713e7bef306c583122ff498084818885cb877fc841c294a90b3ab254a3"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 16): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91d5bc6f2146ace660616e7cd0f296d042c92fcce476affe1deeec109dc64ee"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleOutputVisitor.visit (cyclomatic 16): OracleOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"813550c6dead3e4f4c71353052a906031c367ad41c1ac55c8a3c11b11d153be2"}},{"ruleId":"D1","level":"warning","message":{"text":"OscarOutputVisitor.visit (cyclomatic 16): OscarOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"caed41fd0f1eaabab239043bd9ac308f752ce47a8eff41bd958715d367235c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"PGSQLStatementParser.alterDatabase (cyclomatic 16): PGSQLStatementParser.alterDatabase 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ade5dd41590d7f717ed1d8d23671477e36af03b857e79697c907a327f47d87f"}},{"ruleId":"D1","level":"warning","message":{"text":"PGOutputVisitor.visit (cyclomatic 16): PGOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd97ff031f1bdadc0fa84e90e9680c83c1e7c83660f09137c7e3fef25ff45d4"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLServerStatementParser.parseDeclare (cyclomatic 16): SQLServerStatementParser.parseDeclare 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b2df9c8947bafee2ae9ce66a66cab94bb64f0526ecfb2b011c44840e7a9435"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanLineArgument (cyclomatic 16): Lexer.scanLineArgument 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34b5bcff949cc5b827c2d7d9ea7e2c8d27953463de0d6aa57725a14ae064e27"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLCreateTableParser.createTableBodyItem (cyclomatic 16): SQLCreateTableParser.createTableBodyItem 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d272ab37e67726fbde8ec5ac2a66fce0369e65f7ea725e2fac862a8cbeec78"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLExprParser.orRest (cyclomatic 16): SQLExprParser.orRest 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23091d9e3aeefc280d009bbf0d1f5f606ab83670a93ec940700d97571ee4876"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLSelectParser.parseHierachical (cyclomatic 16): SQLSelectParser.parseHierachical 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6ba6cb510882ad20cf41e8ba91d8e8907ba6b4730808c217fecc75e09a0b7c"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseAlterDrop (cyclomatic 16): SQLStatementParser.parseAlterDrop 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31e626feadc058bd172e6b4fb8d6bdcaa3eb453326408cc865ae750f65f514d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parseMergeWhen (cyclomatic 16): SQLStatementParser.parseMergeWhen 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a63cd0f0dc6e3f0394d6293de0d152876b048970c8ac367cd7b76df9164d11d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLStatementParser.parserParameters (cyclomatic 16): SQLStatementParser.parserParameters 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f87581de2177402a518735d4f912c41af6bbcad83edf80e4075bb779a365de1"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaRepository.console (cyclomatic 16): SchemaRepository.console 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"12486d50f329194a20e15c0bf5627a7470b2614d8d3916f9710be48c8bff9a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"ParameterizedOutputVisitorUtils.parameterizeHash (cyclomatic 16): ParameterizedOutputVisitorUtils.parameterizeHash 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":"core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6307c324931ac69a74a633f7b8faca38b1d1fd18d80701a922d38598485fc7"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.printExpr (cyclomatic 16): SQLASTOutputVisitor.printExpr 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"68367b3289a4c48e633a4b2cd0881e132ec07795570cf403bf36d73cccb2990a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 16): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8138}}}],"partialFingerprints":{"codehealthFindingId/v1":"062573a0a1dcdcbe26a1682fde0e74ef0ab152cc4da40433828d115ba648cba8"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 16): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8080}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1354a3f162c863f0839dba96640fb125cb27d8debf2c4eb4467622078ab873"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 16): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"114282dcdfcc51368e0d9024e1ed4476b45f7254124d21053907c9576e140b43"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 16): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6390}}}],"partialFingerprints":{"codehealthFindingId/v1":"75778c3e427be303576e02bb0347473101e1e39b40875b1a72d3f445e5050fe5"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 16): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11062}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e2a84c5898a5969c873c24f94deb050e3d27ce496a0e1fa4fc8073d94ece2d"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 16): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e452b8025a77a984aa6197d245797e87c85f460681c72b493f630fd017ee38"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cyclomatic 16): SQLASTOutputVisitor.visit 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"c710e7f58aeb6ce61c55e2258bf73f75b094cc064cb9670dfca1b4f3a106ba54"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceServlet.initAuthEnv (cyclomatic 16): ResourceServlet.initAuthEnv 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":"core/src/main/java/com/alibaba/druid/support/http/ResourceServlet.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f8e8ab4b32de951cd28cd36af5b784720233adf938ff0e3a4853e2a1e502db"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceServlet.initAuthEnv (cyclomatic 16): ResourceServlet.initAuthEnv 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":"core/src/main/java/com/alibaba/druid/support/jakarta/ResourceServlet.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"763f6c50ab3b9ec7efa3c8fdb9a2beb5f462a7543981c70f309c138ed6270c91"}},{"ruleId":"D1","level":"warning","message":{"text":"template (cyclomatic 16): template 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":"druid-admin/src/main/resources/support/http/resources/js/doT.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9662a17044f771dd1599af01d4ed41ffcd5758cdf37985ac7c94bdd5a859c3e7"}},{"ruleId":"D1","level":"warning","message":{"text":"template (cyclomatic 16): template 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":"core/src/main/resources/support/http/resources/js/doT.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7086d37ab2731a7b566c6d834a92c37ba0ecb072edc3301692a130a2ec5489f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseAlterSpecification (cognitive 676): MySqlStatementParser.parseAlterSpecification has cognitive complexity 676 (threshold 15). Drivers by points: if/else 561, loops 79, error handling 20, match/switch 12, boolean chains 4 (nesting depth added 558). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5783}}}],"partialFingerprints":{"codehealthFindingId/v1":"648a4177b8425fb819d96f888caea76fdf6f8691800cae35560d942e80fc712f"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanSQLType (cognitive 622): Lexer.scanSQLType has cognitive complexity 622 (threshold 15). Drivers by points: if/else 589, boolean chains 19, loops 14 (nesting depth added 483). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"434a5b8a91fbfc762188d22172023276f761f7def10ed023bb6f83fc2e1df34f"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleCreateTableParser.parseCreateTable (cognitive 531): OracleCreateTableParser.parseCreateTable has cognitive complexity 531 (threshold 15). Drivers by points: if/else 435, loops 71, match/switch 25 (nesting depth added 467). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d915d4048357807894cab5366c0ba95d53ea1220c569a40bfe0ff168b9b239fc"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseShow (cognitive 476): MySqlStatementParser.parseShow has cognitive complexity 476 (threshold 15). Drivers by points: if/else 447, boolean chains 24, loops 5 (nesting depth added 190). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb084d167a93baa73fd8efc9a8e426d8ad9e24871ce5448df9d47689f402329"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableParser.parseCreateTable (cognitive 422): MySqlCreateTableParser.parseCreateTable has cognitive complexity 422 (threshold 15). Drivers by points: if/else 386, loops 21, boolean chains 15 (nesting depth added 297). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3340502e84b5aaeb1ab24adae6c3bfe04ad4822e95be83a9610bc03ffbca9cca"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.primary (cognitive 402): MySqlExprParser.primary has cognitive complexity 402 (threshold 15). Drivers by points: if/else 353, boolean chains 23, ternaries 12, loops 10, error handling 3, match/switch 1 (nesting depth added 297). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"bededfc5da97cf9577ac2148c0cf010213554ceead24d7a95c04f629d725b753"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseTableSourceRest (cognitive 382): SQLSelectParser.parseTableSourceRest has cognitive complexity 382 (threshold 15). Drivers by points: if/else 304, boolean chains 41, ternaries 22, loops 8, match/switch 7 (nesting depth added 222). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d08293523fd753dc2006e864f3fb56af610fe4351db816bbbc70914b8f0ead"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parsePrivilege (cognitive 357): SQLStatementParser.parsePrivilege has cognitive complexity 357 (threshold 15). Drivers by points: if/else 351, loops 5, boolean chains 1 (nesting depth added 269). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e736cceab2d6cfb9e7e21b3df17d0166d45c1f887916427a0b401f050f4c37"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseSelectItemRest (cognitive 341): MySqlExprParser.parseSelectItemRest has cognitive complexity 341 (threshold 15). Drivers by points: if/else 320, boolean chains 21 (nesting depth added 262). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7855225e946a52f6b8c67e84cc91e4e2cb1699beebf6e28f98de9a58d34c31d8"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseStatementList (cognitive 282): OracleStatementParser.parseStatementList has cognitive complexity 282 (threshold 15). Drivers by points: if/else 264, loops 12, boolean chains 6 (nesting depth added 166). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f053bfc24fbd64428e3d34489407710070e0d864343c231f8d5ad8e58fdd60"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseValueClause (cognitive 273): SQLStatementParser.parseValueClause has cognitive complexity 273 (threshold 15). Drivers by points: if/else 254, boolean chains 13, loops 6 (nesting depth added 188). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6662}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f4fe895c58afaf31acf91b6fd135ec149f969417a17c2a422744a503f98aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcUtils.getDriverClassName (cognitive 266): JdbcUtils.getDriverClassName has cognitive complexity 266 (threshold 15). Drivers by points: if/else 264, boolean chains 2 (nesting depth added 189). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"08779ed5f4e3a250674b8bac0f556bb3a3bbcab999e465156a7857d5be17287c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseValueClauseNative (cognitive 262): SQLStatementParser.parseValueClauseNative has cognitive complexity 262 (threshold 15). Drivers by points: if/else 234, boolean chains 18, loops 6, match/switch 4 (nesting depth added 170). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6057}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a64a58476609016da15d75aeae2b9df8bd24442623f6e3b55dacb8e08f2ee3b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseSelectItem (cognitive 246): SQLExprParser.parseSelectItem has cognitive complexity 246 (threshold 15). Drivers by points: if/else 206, boolean chains 26, loops 12, match/switch 2 (nesting depth added 151). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c62173213990db3fbc51777079071e8a3a3470fad76475f7469987db49c6685"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseStatementListDialect (cognitive 230): MySqlStatementParser.parseStatementListDialect has cognitive complexity 230 (threshold 15). Drivers by points: if/else 178, boolean chains 25, loops 25, match/switch 2 (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"038339dd90678b43fb0b4c2cf1c7ec81ab0f312b47ce719853a07df9e96a2d11"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseInsert (cognitive 220): MySqlStatementParser.parseInsert has cognitive complexity 220 (threshold 15). Drivers by points: if/else 180, loops 31, boolean chains 6, error handling 3 (nesting depth added 141). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e691fe0c30da57a5d33f57ed3a1872ba97a63aa5afda9aa52e9304309832336"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseValueClause (cognitive 213): SQLStatementParser.parseValueClause has cognitive complexity 213 (threshold 15). Drivers by points: if/else 191, boolean chains 12, loops 6, match/switch 4 (nesting depth added 144). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6388}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad808bb08208bb915056233455eacaa32983270f226b3e30607a13069e48e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parserAlter (cognitive 194): OracleStatementParser.parserAlter has cognitive complexity 194 (threshold 15). Drivers by points: if/else 150, loops 44 (nesting depth added 151). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"570bb0123b4e8f15f43ca94c9542721d0da5dc6d4b80216d980ca8fa1f031847"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableParser.parseOptions (cognitive 187): MySqlCreateTableParser.parseOptions has cognitive complexity 187 (threshold 15). Drivers by points: if/else 161, loops 22, error handling 3, boolean chains 1 (nesting depth added 112). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18cd3c7d9f47421a5922a823cdd0b3f512cce7750ddab16a77a690b0b4cf239"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parserParameters (cognitive 184): OracleStatementParser.parserParameters has cognitive complexity 184 (threshold 15). Drivers by points: if/else 175, boolean chains 8, loops 1 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16bec1d5bf20b96e50d408303e5c339d6bcdd41bb88726fd24f957472faa46c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLTimestampExpr.check (cognitive 173): SQLTimestampExpr.check has cognitive complexity 173 (threshold 15). Drivers by points: if/else 149, boolean chains 23, match/switch 1 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb303eff56043437f5c28e7fa5e7077088df90a4ec61ac833047048d1f6c070"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseCreateIndex (cognitive 173): OracleStatementParser.parseCreateIndex has cognitive complexity 173 (threshold 15). Drivers by points: if/else 123, loops 50 (nesting depth added 138). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"8207ab1faace8713d3b00f57032a14fe319e649d20ffd6195f5cd7323b5720e0"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsCreateTableParser.parseCreateTable (cognitive 172): OdpsCreateTableParser.parseCreateTable has cognitive complexity 172 (threshold 15). Drivers by points: if/else 137, loops 15, boolean chains 11, match/switch 9 (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09fb3626b450a98a8becd733450633ab863a16c670b00ddad67043b4042674d"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolveIdent (cognitive 171): SchemaResolveVisitorFactory.resolveIdent has cognitive complexity 171 (threshold 15). Drivers by points: if/else 150, boolean chains 13, loops 8 (nesting depth added 106). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47c36d481649e6cae34be353ca4ec1552813ef996313ff8c735e630ffaef956"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parseStatementListDialect (cognitive 157): OdpsStatementParser.parseStatementListDialect has cognitive complexity 157 (threshold 15). Drivers by points: if/else 133, boolean chains 11, match/switch 7, error handling 4, loops 2 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad874288b1be63a1a93621825675f95cd03d80bfa5cbfedb3350d28c2f2d830"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUtils.parseDateTime (cognitive 156): MySqlUtils.parseDateTime has cognitive complexity 156 (threshold 15). Drivers by points: if/else 132, boolean chains 22, match/switch 2 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a805c8d8549a0bbd5be5cc1c67baced5c9ba5ed5b771b51462c392eb406552a"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseIndexOptions (cognitive 150): MySqlExprParser.parseIndexOptions has cognitive complexity 150 (threshold 15). Drivers by points: if/else 130, loops 10, match/switch 8, boolean chains 2 (nesting depth added 117). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8e1d8b2994641b98058617ab357816bdc7e9599df622ab1cadbef39002765a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 148): SQLASTOutputVisitor.visit has cognitive complexity 148 (threshold 15). Drivers by points: if/else 96, loops 29, ternaries 12, boolean chains 9, match/switch 2 (nesting depth added 87). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0451a9391678d5ff5ac982019731caa88be2e11225ef8603890f62527c36e5df"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.visit (cognitive 148): SQLEvalVisitorUtils.visit has cognitive complexity 148 (threshold 15). Drivers by points: if/else 139, boolean chains 8, match/switch 1 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"734f199201b5d6cd9fc58b187631ea9ac72fe9554b6131ba3554fa01d3f7426d"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcUtils.printResultSet (cognitive 146): JdbcUtils.printResultSet has cognitive complexity 146 (threshold 15). Drivers by points: if/else 139, loops 5, boolean chains 2 (nesting depth added 102). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f239bf71c9298ef5ba56c319523f4ad54fd3a215586045b89f8d4e9de24c7c4"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseTableOptions (cognitive 144): MySqlExprParser.parseTableOptions has cognitive complexity 144 (threshold 15). Drivers by points: if/else 130, ternaries 7, boolean chains 6, loops 1 (nesting depth added 97). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"924647d2a59648802d080d45b8f359a0c870fa9206bd742e31fa420fc4976946"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleRowNumToLimit.visit (cognitive 144): OracleRowNumToLimit.visit has cognitive complexity 144 (threshold 15). Drivers by points: if/else 118, ternaries 14, boolean chains 12 (nesting depth added 96). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"574268b4ba6d61e992a6b4bb764f297286810439913e4a9d69ef9ebd21e2ef78"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.queryRest (cognitive 144): SQLSelectParser.queryRest has cognitive complexity 144 (threshold 15). Drivers by points: if/else 125, ternaries 7, loops 5, boolean chains 4, match/switch 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"051ce7732785176caf5fda7556e4ed3a95741d0619d28b7e863d8350226302d0"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.unwrapExpr (cognitive 135): SchemaStatVisitor.unwrapExpr has cognitive complexity 135 (threshold 15). Drivers by points: if/else 131, boolean chains 3, loops 1 (nesting depth added 100). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd049fee055e2a9b48994eafc4888b9d3296cd9995fca6f6711da6796936b542"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.nextToken (cognitive 133): Lexer.nextToken has cognitive complexity 133 (threshold 15). Drivers by points: if/else 102, boolean chains 23, match/switch 7, loops 1 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6e46797c54ffdaa0f94a6fb621527a3836113cff0b48d2001d67af8bef05ae"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUtils.parseDate (cognitive 133): MySqlUtils.parseDate has cognitive complexity 133 (threshold 15). Drivers by points: if/else 106, boolean chains 24, match/switch 2, ternaries 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"21588cd0f9383ffc046ae8867cada23d3b463f9283b4f30931fd7751260ec9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcUtils.getDbTypeRaw (cognitive 130): JdbcUtils.getDbTypeRaw has cognitive complexity 130 (threshold 15). Drivers by points: if/else 114, boolean chains 16 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6321e0ca056d210cdaaa70e51cf0005dabb56b4ce03113603ae8fb15160123"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkUpdate (cognitive 129): WallVisitorUtils.checkUpdate has cognitive complexity 129 (threshold 15). Drivers by points: if/else 100, loops 23, boolean chains 6 (nesting depth added 87). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"67615316da36e8353ef20f964c2c65baadb7d3d09b3ea5fc565c91e471489788"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 127): SchemaResolveVisitorFactory.resolve has cognitive complexity 127 (threshold 15). Drivers by points: if/else 107, loops 18, boolean chains 2 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6c0b3f70cd0a032fc661d66fc3e375b8852d47e6e08ec4d1360b46dac4ebad"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableParser.partitionClauseRest (cognitive 126): MySqlCreateTableParser.partitionClauseRest has cognitive complexity 126 (threshold 15). Drivers by points: if/else 99, loops 22, boolean chains 5 (nesting depth added 85). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a36e2cdba05c6d3f543215e977862be8c4cf07b9a5964aa9297fcdb0005481c"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsExprParser.primaryRest (cognitive 126): OdpsExprParser.primaryRest has cognitive complexity 126 (threshold 15). Drivers by points: if/else 87, loops 27, boolean chains 9, match/switch 3 (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4b9b27d3a91c33b5cac685c70b44221ba2565c7f7e9cfdf6dd3fc3ceca58cf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 122): SQLASTOutputVisitor.visit has cognitive complexity 122 (threshold 15). Drivers by points: ternaries 78, if/else 42, loops 2 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9386}}}],"partialFingerprints":{"codehealthFindingId/v1":"395aea1066f63fbe78dc66564c01cd070795d937aa6f6e6455c0065362badb07"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.inRest (cognitive 121): SQLExprParser.inRest has cognitive complexity 121 (threshold 15). Drivers by points: if/else 102, loops 8, boolean chains 7, match/switch 4 (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1604a2f7e618cb358259a2b9a23a46116b4435334bde6ddf6b1b20c7448d297"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateMaterializedViewRest (cognitive 119): MySqlStatementParser.parseCreateMaterializedViewRest has cognitive complexity 119 (threshold 15). Drivers by points: if/else 106, loops 12, boolean chains 1 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":9231}}}],"partialFingerprints":{"codehealthFindingId/v1":"59259a1f3a07f40b585d733075aaa8fbe3bf1f6f66c22604e978b800a18812f3"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 118): SQLASTOutputVisitor.visit has cognitive complexity 118 (threshold 15). Drivers by points: ternaries 66, if/else 48, boolean chains 4 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7870}}}],"partialFingerprints":{"codehealthFindingId/v1":"073a6864e250e71a8f5f71059312d5d2d58916017ecdd772626a7a0cc85519a6"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 118): SQLASTOutputVisitor.visit has cognitive complexity 118 (threshold 15). Drivers by points: ternaries 67, if/else 42, loops 8, boolean chains 1 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f526b6762f846f1b44032d9a4462f5fc5fbfd5141935317727eb9c1f6d1f8f6e"}},{"ruleId":"D2","level":"warning","message":{"text":"TDDLHint.\u003Cinit\u003E (cognitive 115): TDDLHint.\u003Cinit\u003E has cognitive complexity 115 (threshold 15). Drivers by points: if/else 102, loops 8, boolean chains 4, match/switch 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d24bfc46b4871177327ebcf565facaf697c5ea9372261d8c0a7fca140f9aa27"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 114): PGOutputVisitor.visit has cognitive complexity 114 (threshold 15). Drivers by points: ternaries 63, if/else 47, boolean chains 4 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adc81b33b3b4631c78cb44e0764f572eec38578ddb6a8f38c55df9d8c3205d8"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 111): MySqlOutputVisitor.visit has cognitive complexity 111 (threshold 15). Drivers by points: ternaries 64, if/else 41, boolean chains 2, loops 2, match/switch 2 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6487c56d28650026962ff85fa288ad0e43998c568e0191407dc5e14bd994692"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.visit (cognitive 111): SchemaStatVisitor.visit has cognitive complexity 111 (threshold 15). Drivers by points: if/else 103, boolean chains 5, loops 3 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1e8ade6a4901f388c226ab34a4a34de3259e39ec195c4f39f849b9905da1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseAlterDrop (cognitive 110): MySqlStatementParser.parseAlterDrop has cognitive complexity 110 (threshold 15). Drivers by points: if/else 99, loops 9, boolean chains 2 (nesting depth added 85). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b1668129337cf3fa1f59f32514b3d2b83a31a7bab57f109faec49f04537f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateDatabase (cognitive 109): MySqlStatementParser.parseCreateDatabase has cognitive complexity 109 (threshold 15). Drivers by points: if/else 85, loops 20, boolean chains 4 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7813}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b92312206bb8f7433612fefe073cf73dc6a0ff0011ef73534df45ba7f4cfb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanOperator (cognitive 105): Lexer.scanOperator has cognitive complexity 105 (threshold 15). Drivers by points: if/else 100, boolean chains 2, loops 2, match/switch 1 (nesting depth added 48). 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebf8be1a07bd867225b3b03f5622cec25a79baac7a30488c1addc0d26d49f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 104): SQLASTOutputVisitor.visit has cognitive complexity 104 (threshold 15). Drivers by points: if/else 74, ternaries 16, boolean chains 12, loops 2 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b11aa34f403bb811f8cf199f60b6f946f7f5ec967a1237a6d7c8262ffc435"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlLexer.scanComment (cognitive 103): MySqlLexer.scanComment has cognitive complexity 103 (threshold 15). Drivers by points: if/else 69, boolean chains 22, loops 10, ternaries 2 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3a0861d3065f855eafe0d2359bd293d5ea4dc703ff2709c00a8234fbf4643f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 103): MySqlOutputVisitor.visit has cognitive complexity 103 (threshold 15). Drivers by points: if/else 66, ternaries 25, loops 11, boolean chains 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1de1900b112200da700ba063d1eace5ee641b4c272ed2a67bea350b3161899c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.methodRest (cognitive 103): SQLExprParser.methodRest has cognitive complexity 103 (threshold 15). Drivers by points: if/else 93, boolean chains 7, loops 3 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9591b57e4e8b195e54a912c8589f03369475709a64a07f3974a7f38fd60b179"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseColumnRest (cognitive 102): SQLExprParser.parseColumnRest has cognitive complexity 102 (threshold 15). Drivers by points: if/else 99, boolean chains 2, match/switch 1 (nesting depth added 65). 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4855}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb81e2d26ec414d07f594253332ef3db8a9b5051b5a69d34f68a25ca3748e327"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 102): SQLASTOutputVisitor.visit has cognitive complexity 102 (threshold 15). Drivers by points: ternaries 64, if/else 37, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1636c0f8831234180605bf158cf0a481006dbbc2f860c7795bb37ed50d1e6d3"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.visit (cognitive 102): SchemaStatVisitor.visit has cognitive complexity 102 (threshold 15). Drivers by points: if/else 88, boolean chains 11, loops 3 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"051120faccdf890f17dc9d5bfd7f5b16a88a1b593157beedcefe8ffabdd94c36"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.shrink (cognitive 101): DruidDataSource.shrink has cognitive complexity 101 (threshold 15). Drivers by points: if/else 78, error handling 13, boolean chains 5, loops 5 (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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b2cf2b6e3b55e07ddb8b53adadaa274ca6ad11f6b67fdb041a38cc531adcf7"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParserUtils.splitAndRemoveComment (cognitive 101): SQLParserUtils.splitAndRemoveComment has cognitive complexity 101 (threshold 15). Drivers by points: if/else 71, boolean chains 16, ternaries 11, loops 3 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c9d4ed629a6e65be17324e92db53c951a7f68af6da00a008c612be2858deec"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 100): SQLASTOutputVisitor.visit has cognitive complexity 100 (threshold 15). Drivers by points: if/else 68, ternaries 15, loops 9, boolean chains 8 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4187}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f8cf39f8ed35aa47614b9a45d66f39138556dfec08856afc8d5e6a95701c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"WebAppStat.computeUserAgent (cognitive 100): WebAppStat.computeUserAgent has cognitive complexity 100 (threshold 15). Drivers by points: if/else 89, boolean chains 9, match/switch 2 (nesting depth added 16). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStat.java"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a46a775a2e5b7cb1e7ef5cf3a146e245baef15dca0dbe8425bdcb75b967230"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleCreateTableParser.parseOrganization (cognitive 99): OracleCreateTableParser.parseOrganization has cognitive complexity 99 (threshold 15). Drivers by points: if/else 99 (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b8d3381f59ce9983583bd5330d1a2ca5107552bbea9951fb51ef06ed5551f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanSQLTypeV2 (cognitive 99): Lexer.scanSQLTypeV2 has cognitive complexity 99 (threshold 15). Drivers by points: if/else 68, ternaries 15, loops 7, boolean chains 6, match/switch 3 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"91524e4b5eb0411b209420382ff93aa4edd8717cd7a32e09aea960795f8b8545"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseAlterTable (cognitive 98): OracleStatementParser.parseAlterTable has cognitive complexity 98 (threshold 15). Drivers by points: if/else 89, loops 8, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"475298740e67448be8918f202242f2a5a11da04512c18b71e582fe154c27648c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 98): SQLASTOutputVisitor.visit has cognitive complexity 98 (threshold 15). Drivers by points: ternaries 61, if/else 36, boolean chains 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8848}}}],"partialFingerprints":{"codehealthFindingId/v1":"888704b57f456048eb9e2eed124a56176fbb6646e787997422292a09a09d86d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseStatementList (cognitive 96): SQLStatementParser.parseStatementList has cognitive complexity 96 (threshold 15). Drivers by points: if/else 76, boolean chains 11, loops 7, match/switch 2 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc889191cc709fa20ad20b11489a6019424682a7f5bf3b5a28d0b9ea9399a427"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 94): MySqlOutputVisitor.visit has cognitive complexity 94 (threshold 15). Drivers by points: ternaries 56, if/else 34, boolean chains 2, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c18944676b991e0324a8e53263683b43778870532d355c1869b5e476a94b151"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 94): OracleOutputVisitor.visit has cognitive complexity 94 (threshold 15). Drivers by points: ternaries 49, if/else 39, boolean chains 4, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cd674cc35550dc3bebac58b33c2622fd7c9efd4f9958d2688c4ba0fe56f0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 93): MySqlOutputVisitor.visit has cognitive complexity 93 (threshold 15). Drivers by points: if/else 59, ternaries 29, loops 4, boolean chains 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9507ae30c4c6b6ed83d46a016c2d0d6708f7efca701e806fdd2cc7ab47e0c75f"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.extractColumns (cognitive 93): SchemaResolveVisitorFactory.extractColumns has cognitive complexity 93 (threshold 15). Drivers by points: if/else 66, loops 26, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bf180384aaf9de660867771cc1312b236a76cf573f9c2b8927518d6f6cfdf6"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.visitOrderBy (cognitive 93): SchemaStatVisitor.visitOrderBy has cognitive complexity 93 (threshold 15). Drivers by points: if/else 85, boolean chains 4, loops 4 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"892eb6fe684658965bce7862f30701eda9bf1674ce081431ab0c1cc0232dcea5"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanNumber (cognitive 92): Lexer.scanNumber has cognitive complexity 92 (threshold 15). Drivers by points: if/else 59, boolean chains 23, loops 10 (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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"87552307387dc0b72db3a388fa7da25abf2ceb94d17c223d2eb0d43f73475d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectParser.parseTableSource (cognitive 91): MySqlSelectParser.parseTableSource has cognitive complexity 91 (threshold 15). Drivers by points: if/else 78, boolean chains 13 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec001fe9417d7239a278ec573a36669e7bf8fa9ee4d41e9bbb69f0170fefe4"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseAggregateExpr (cognitive 91): OracleExprParser.parseAggregateExpr has cognitive complexity 91 (threshold 15). Drivers by points: if/else 91 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1590c991bfd958acb6eca00fdf83c2435436c00883eaa43707f5c52880c403e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseCreate (cognitive 91): SQLStatementParser.parseCreate has cognitive complexity 91 (threshold 15). Drivers by points: if/else 88, boolean chains 2, match/switch 1 (nesting depth added 60). 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4096}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d16f2dade0e623c5ae25a6dc106f549a846c07e97fa26cfe109dbab0b7d9f4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visitInternal (cognitive 91): SQLASTOutputVisitor.visitInternal has cognitive complexity 91 (threshold 15). Drivers by points: if/else 63, boolean chains 16, loops 6, ternaries 6 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f363dc4e947a7c06ecd08d11124f1e906bd9796b24d37f7446651342fd96178"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.getConnectionInternal (cognitive 90): DruidDataSource.getConnectionInternal has cognitive complexity 90 (threshold 15). Drivers by points: if/else 75, boolean chains 6, error handling 6, loops 3 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c85e526c8c1db287a8728afc010d8e2c64bf6509f3db5c61ef02fc7cea6fa34"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseDataType (cognitive 90): SQLExprParser.parseDataType has cognitive complexity 90 (threshold 15). Drivers by points: if/else 77, boolean chains 8, loops 5 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a2a05a44f9015b1a55bcf85b47588a2f735532fdf8208ccf59c05323375e19"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseProcedureStatementList (cognitive 88): MySqlStatementParser.parseProcedureStatementList has cognitive complexity 88 (threshold 15). Drivers by points: if/else 85, boolean chains 2, loops 1 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8392}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c380f64d6f20f307a77ebc1958e61b06ffaa531a8a3588b56e8c97aa06982a"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanVariable (cognitive 88): Lexer.scanVariable has cognitive complexity 88 (threshold 15). Drivers by points: if/else 57, loops 17, boolean chains 11, ternaries 3 (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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd42f88c254918067ff054863b29d261a62a0a0c375feb40f87d57039de37092"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 87): MySqlOutputVisitor.visit has cognitive complexity 87 (threshold 15). Drivers by points: ternaries 48, if/else 34, loops 3, boolean chains 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cda3c7d0f075d9e4996d065339991a731b426724e51dfdc00c4f342e03938f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitorBinaryOpSupport.visitBinaryOpExprGroup (cognitive 87): SQLASTOutputVisitorBinaryOpSupport.visitBinaryOpExprGroup has cognitive complexity 87 (threshold 15). Drivers by points: if/else 71, boolean chains 8, loops 8 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitorBinaryOpSupport.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afe5ef44f4ba2abd5506bfa4bb8c42a534c2b62cb087347589befc40a8f14f6"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaRepository.acceptCreateTable (cognitive 86): SchemaRepository.acceptCreateTable has cognitive complexity 86 (threshold 15). Drivers by points: if/else 68, loops 11, error handling 5, 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1468b89d8da478dd40ed8a2ee359245390b3cf6eb21b2eea275e4d2fec691c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visitBinaryLeft (cognitive 86): SQLASTOutputVisitor.visitBinaryLeft has cognitive complexity 86 (threshold 15). Drivers by points: if/else 71, boolean chains 8, match/switch 7 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b10097be4abb08629c0a7899113e348f835fc49402e153ecb15215cdc59840"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2ExprParser.primaryRest (cognitive 84): DB2ExprParser.primaryRest has cognitive complexity 84 (threshold 15). Drivers by points: if/else 82, boolean chains 2 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"96806bb9c88713ed777cc3e929d261f603ae67140a786c20a0a14e03066da857"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveLexer.scanComment (cognitive 83): HiveLexer.scanComment has cognitive complexity 83 (threshold 15). Drivers by points: if/else 63, loops 12, boolean chains 6, ternaries 2 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"07537f013e2aacdde5c01f6a8e682446d31dff9892cbef7a2428b8658fea6832"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsSelectParser.query (cognitive 83): OdpsSelectParser.query has cognitive complexity 83 (threshold 15). Drivers by points: if/else 67, loops 6, match/switch 6, boolean chains 4 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3557fda7adc2994465a9860e3038de6a09bdb6b4bdb4a44bb0f0f20d5db487ed"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarSelectParser.query (cognitive 83): OscarSelectParser.query has cognitive complexity 83 (threshold 15). Drivers by points: if/else 72, loops 8, boolean chains 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc53c54450a899abd343167236a77c715335f362f7b98ca0e910bcbf7d5515e3"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveCreateTableParser.parseCreateTableRest (cognitive 82): HiveCreateTableParser.parseCreateTableRest has cognitive complexity 82 (threshold 15). Drivers by points: if/else 70, boolean chains 6, loops 6 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c6ca067253f02d8958c72ed59b02f40f8603fcfd3bdcb035710570b54aa7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleToMySqlOutputVisitor.visit (cognitive 82): OracleToMySqlOutputVisitor.visit has cognitive complexity 82 (threshold 15). Drivers by points: if/else 63, ternaries 11, boolean chains 5, loops 3 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleToMySqlOutputVisitor.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6948274214a1454ca4ac4193a634335b32893386d7c1bde57fab748c56f33eb"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSelectParser.query (cognitive 82): PGSelectParser.query has cognitive complexity 82 (threshold 15). Drivers by points: if/else 71, loops 8, boolean chains 3 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9800ddbf3676b1d8d6f4b8dfa8fd8dbdc2758dfd2db03109869371cb3b183d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseGroupBy (cognitive 82): SQLSelectParser.parseGroupBy has cognitive complexity 82 (threshold 15). Drivers by points: if/else 62, loops 10, boolean chains 6, ternaries 4 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b88f03dbaa5a4f57cc7c87daf16a1d29239d85e5327bd79c9ba28bf57362ba"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectParser.parsePivot (cognitive 80): OracleSelectParser.parsePivot has cognitive complexity 80 (threshold 15). Drivers by points: if/else 59, loops 21 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b875909e079bf713cbcccab9bd2fbc6342b2d68424955c2e05d659d0b8b32ae"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printTableSourceExpr (cognitive 80): SQLASTOutputVisitor.printTableSourceExpr has cognitive complexity 80 (threshold 15). Drivers by points: if/else 75, boolean chains 5 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9936c470154ef04f97e4fbcb013a8d7d8778ad7f68e293815609dbc341a61b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidStatManagerFacade.mergeWallStat (cognitive 80): DruidStatManagerFacade.mergeWallStat has cognitive complexity 80 (threshold 15). Drivers by points: if/else 44, loops 20, ternaries 9, boolean chains 7 (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":"core/src/main/java/com/alibaba/druid/stat/DruidStatManagerFacade.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe33550332fd98b7cff4234f721321715a84eb9bda9b1e5335c1829ee5bf783f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectParser.query (cognitive 79): MySqlSelectParser.query has cognitive complexity 79 (threshold 15). Drivers by points: if/else 71, boolean chains 4, loops 4 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b178727132310d1108350b7d9da6203b50b4847450815fc59bfa128e6cc0c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.primaryRest (cognitive 79): OracleExprParser.primaryRest has cognitive complexity 79 (threshold 15). Drivers by points: if/else 71, boolean chains 5, match/switch 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a42cb1e774b9b5b766f37a1c084f7b75b9bbda47def9afcdc6be9cecd80db3"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseDrop (cognitive 79): SQLStatementParser.parseDrop has cognitive complexity 79 (threshold 15). Drivers by points: if/else 61, loops 14, boolean chains 3, match/switch 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e349ae5339d712359a09c377d51b28dc6bd8a4d7bb2d1688583ec90d812396"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.getColumn (cognitive 79): SchemaStatVisitor.getColumn has cognitive complexity 79 (threshold 15). Drivers by points: if/else 73, boolean chains 6 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c500fb625d5abdc568042c6e6343b29bc95fba992a0e3a9cf839911ed3ff68f"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveStatementParser.parseStatementListDialect (cognitive 78): HiveStatementParser.parseStatementListDialect has cognitive complexity 78 (threshold 15). Drivers by points: if/else 73, boolean chains 3, match/switch 2 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cae0ec568be2c6ebde48f1997a96e162a7dd23e5c990b2bde99f0385c82cb2f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.primaryRest (cognitive 78): MySqlExprParser.primaryRest has cognitive complexity 78 (threshold 15). Drivers by points: if/else 71, loops 4, boolean chains 3 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c115cb55242dd53273b4b74d1c25936f2c88b76ef1943f58657f65f0cdd727"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parseShow (cognitive 78): OdpsStatementParser.parseShow has cognitive complexity 78 (threshold 15). Drivers by points: if/else 75, boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"f791f6d1cc3287e30429a10489dacc7f2c5a7c2a8152470bda2f7475c3182ba7"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlLexer.scanIdentifier (cognitive 77): MySqlLexer.scanIdentifier has cognitive complexity 77 (threshold 15). Drivers by points: if/else 53, boolean chains 8, loops 8, ternaries 8 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f1d3ed9d407c519b84a9ce7a9e3e7e20504e916458c8a0eb7ef31b694e1fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUtils.createXAConnection (cognitive 76): MySqlUtils.createXAConnection has cognitive complexity 76 (threshold 15). Drivers by points: if/else 38, error handling 32, boolean chains 6 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e667843bdf8fbe8a9dc12d9bfd7dd2e429d9bcbc8a81e13d2cf4e00c30bfeeca"}},{"ruleId":"D2","level":"warning","message":{"text":"WallProvider.checkInternal (cognitive 76): WallProvider.checkInternal has cognitive complexity 76 (threshold 15). Drivers by points: if/else 52, boolean chains 10, loops 8, error handling 6 (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":"core/src/main/java/com/alibaba/druid/wall/WallProvider.java"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3199a88c8588bde76644ae7e2a6267ba624b3116deefd420cba537767652f1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parsePartition (cognitive 75): MySqlExprParser.parsePartition has cognitive complexity 75 (threshold 15). Drivers by points: if/else 69, boolean chains 3, loops 3 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6060f6444dd59b9c20cc0b25cd97aac494e5788ffabd51787d4bc4cc080f724f"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 75): OscarOutputVisitor.visit has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 38, if/else 33, boolean chains 2, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ac858ab7b1d81603cf0de4db54ae3cc473822464102f1544b96ace947f40c1"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 75): PGOutputVisitor.visit has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 38, if/else 33, boolean chains 2, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0413975d1236e58c22e09228d841fcf377a58d6df14292a37c66ecfaaee373"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.over (cognitive 75): SQLExprParser.over has cognitive complexity 75 (threshold 15). Drivers by points: if/else 63, boolean chains 8, match/switch 4 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2665}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc2918758b278e7ab67ab4c2d837992bc2be3d705e682bde1282e0421af175a"}},{"ruleId":"D2","level":"warning","message":{"text":"TDOutputVisitor.printSqlSetQuantifier (cognitive 74): TDOutputVisitor.printSqlSetQuantifier has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 46, if/else 25, boolean chains 3 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/teradata/visitor/TDOutputVisitor.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd9120e19ce849a5e71dd2b120a7f565ab5da5b3e3f86e65d356bd9ed93d016"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.primaryRest (cognitive 74): SQLExprParser.primaryRest has cognitive complexity 74 (threshold 15). Drivers by points: if/else 63, loops 6, boolean chains 5 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0573387f385133af295be86924a3e4a64abe2a9c83a7b98b759080f8bfcbbc0d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 74): SQLASTOutputVisitor.visit has cognitive complexity 74 (threshold 15). Drivers by points: if/else 50, ternaries 12, boolean chains 6, loops 6 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4715}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6ce2f3cae35b94b449b0f53ebb5aea21f4ae145950434fea3f12e13e29209e"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 73): MySqlOutputVisitor.visit has cognitive complexity 73 (threshold 15). Drivers by points: ternaries 45, if/else 27, boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4794}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f5284f31a5489ebb492fa3329c86d333d1fbec75d1b4dcc6e55fef61c1f06e"}},{"ruleId":"D2","level":"warning","message":{"text":"PrestoStatementParser.parseStatementListDialect (cognitive 73): PrestoStatementParser.parseStatementListDialect has cognitive complexity 73 (threshold 15). Drivers by points: if/else 70, boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a059b773c3b42872484e3d0187d0f19d2bbee60f0dea44b0ec57fbab123a44f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPropertyExpr.computeDataType (cognitive 72): SQLPropertyExpr.computeDataType has cognitive complexity 72 (threshold 15). Drivers by points: if/else 61, loops 11 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLPropertyExpr.java"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00ee8e2d34fc245ca2edaf0f3a3df9168c94c3103ccbfe25b6e7c853ab1153d"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussDbStatementParser.parseInsert (cognitive 72): GaussDbStatementParser.parseInsert has cognitive complexity 72 (threshold 15). Drivers by points: if/else 56, loops 11, error handling 5 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e60ec0c777251a83f8520047800411e879633ee03455e0f8677e0d1d7a40e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 72): SQLASTOutputVisitor.visit has cognitive complexity 72 (threshold 15). Drivers by points: if/else 33, ternaries 32, loops 6, boolean chains 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5703}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfbca53ee684713682eca61cbf34d3d86cd16615910b8b9197d77a35ddf1d87"}},{"ruleId":"D2","level":"warning","message":{"text":"StringUtils.isNumber (cognitive 72): StringUtils.isNumber has cognitive complexity 72 (threshold 15). Drivers by points: if/else 48, boolean chains 19, loops 4, ternaries 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":"core/src/main/java/com/alibaba/druid/util/StringUtils.java"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dceb7c283c2d75c585958f1fa8887ce8c41926270e77945308209061117ee2e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseTableSource (cognitive 71): SQLSelectParser.parseTableSource has cognitive complexity 71 (threshold 15). Drivers by points: if/else 59, boolean chains 6, loops 6 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f5e611cbf21ea24d5b0fd71519e7c270b4b300fa12a6c9f463835808c1c0cb"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidAbstractDataSource.createPhysicalConnection (cognitive 70): DruidAbstractDataSource.createPhysicalConnection has cognitive complexity 70 (threshold 15). Drivers by points: if/else 54, boolean chains 7, error handling 7, ternaries 2 (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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef90b6878747e87777201299c5bf0d5098d5d79f66c65a0459dad7b2f9aab73"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.init (cognitive 70): DruidDataSource.init has cognitive complexity 70 (threshold 15). Drivers by points: if/else 45, error handling 9, loops 9, boolean chains 7 (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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b56b265cd2f2e638dd405a4ffda935bdd7e21b6545ace56058ce621f29f2e55"}},{"ruleId":"D2","level":"warning","message":{"text":"StringUtils.isNumber (cognitive 70): StringUtils.isNumber has cognitive complexity 70 (threshold 15). Drivers by points: if/else 46, boolean chains 19, loops 4, ternaries 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/StringUtils.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a90c766b5d0e1574dec1c50d6a84508acd167720e0ae66040b6e87a423fa57f"}},{"ruleId":"D2","level":"warning","message":{"text":"DmSelectParser.query (cognitive 69): DmSelectParser.query has cognitive complexity 69 (threshold 15). Drivers by points: if/else 62, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb30630553205cefb11581224eddb65279b2f3b08736b5b2322f512271b5fe36"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 69): SchemaResolveVisitorFactory.resolve has cognitive complexity 69 (threshold 15). Drivers by points: if/else 66, boolean chains 3 (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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c223415944fcb898905bddf21ca7f2e5a383da1e61706e71a485924711f9900"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 69): SQLASTOutputVisitor.visit has cognitive complexity 69 (threshold 15). Drivers by points: ternaries 38, if/else 23, loops 6, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdd07521df8eb49a06f68afabdc92ad8d3faec6a45c36d6e811ceac3f5c4e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkSchema (cognitive 69): WallVisitorUtils.checkSchema has cognitive complexity 69 (threshold 15). Drivers by points: if/else 54, loops 10, boolean chains 5 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce381ba66b07a13099c028443c9ae0b12d1e4d63915defecf0618d280ad57e0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLDataTypeImpl.jdbcType (cognitive 68): SQLDataTypeImpl.jdbcType has cognitive complexity 68 (threshold 15). Drivers by points: if/else 48, boolean chains 20. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4936a947b480699197eb0be89caf68c588c24333fdf90ccd59c98f73f523639"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportParameterVisitorUtils.exportParameter (cognitive 68): ExportParameterVisitorUtils.exportParameter has cognitive complexity 68 (threshold 15). Drivers by points: if/else 54, loops 14 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/ExportParameterVisitorUtils.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b3140b8a7dbf018e2292bbd78691a9b5971dff4f31e967b41668c59690edea"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 67): MySqlOutputVisitor.visit has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 42, if/else 23, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa0ecff5cf848d86216ea0f4403063a1b1b15365e5e722c60669eb1f6c8131a"}},{"ruleId":"D2","level":"warning","message":{"text":"CalciteMySqlNodeVisitor.visit (cognitive 67): CalciteMySqlNodeVisitor.visit has cognitive complexity 67 (threshold 15). Drivers by points: if/else 63, boolean chains 3, match/switch 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":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"5159aa89aefa677593b23fbcade2563cddde83595e8223a532ac6707ffc1bfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlTypeUDF.evaluate (cognitive 66): SqlTypeUDF.evaluate has cognitive complexity 66 (threshold 15). Drivers by points: if/else 43, loops 10, boolean chains 5, error handling 4, match/switch 3, ternaries 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":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlTypeUDF.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9367f8b9acb38538fdba65564f579dcab2643e9684071baaa8b82dfb5dc7056e"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.queryBlockFromIsNull (cognitive 66): WallVisitorUtils.queryBlockFromIsNull has cognitive complexity 66 (threshold 15). Drivers by points: if/else 55, loops 8, boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c161684bd144ca48d4f48822913cbac068551ea92abd6a24146323f5ea12ac"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParser.tableAlias (cognitive 65): SQLParser.tableAlias has cognitive complexity 65 (threshold 15). Drivers by points: if/else 53, boolean chains 9, match/switch 3 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6f16b0c2662ecd49fe5cb24440d24b4ab8cad3d583a71db08a111fcf5b9dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.printValuesList (cognitive 64): MySqlOutputVisitor.printValuesList has cognitive complexity 64 (threshold 15). Drivers by points: if/else 36, loops 20, boolean chains 5, ternaries 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4fd2be0d6862356d7e6053dbc626b9e974377fafa2d1c40ea1c099341077db"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSourceFactory.config (cognitive 63): DruidDataSourceFactory.config has cognitive complexity 63 (threshold 15). Drivers by points: if/else 55, error handling 7, loops 1 (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSourceFactory.java"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6322bedae7cc0309441c1f2a13d141b38e298c5f1fef7085bb4bec56d43ec97"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.relationalRest (cognitive 63): SQLExprParser.relationalRest has cognitive complexity 63 (threshold 15). Drivers by points: if/else 54, match/switch 4, boolean chains 3, error handling 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d16a431f4a168efadd598e21ad79d41d3757212283a204dcb9e2afe30267dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseSubPartition (cognitive 62): MySqlExprParser.parseSubPartition has cognitive complexity 62 (threshold 15). Drivers by points: if/else 59, boolean chains 2, loops 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"408a1a891f8532bc761dda0290def9cffada003179a82a4c0b9f9f7d755eee2e"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 62): MySqlOutputVisitor.visit has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 39, if/else 23 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaf8c28bc1594ce39bf76f689b67ac69ee90b9d5cc329758cddae54f89befe4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 62): SQLASTOutputVisitor.visit has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 43, if/else 19 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9321}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d1d7aa254142307a0f33c3e3712542568c7abd911bb7e17a3ae34fef3f21e"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussDbOutputVisitor.visit (cognitive 61): GaussDbOutputVisitor.visit has cognitive complexity 61 (threshold 15). Drivers by points: if/else 31, ternaries 30 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6c617af267356641401aaa15df1dca001b9f9e0cecf2254799ebb370e20052"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableParser.parseConstraint (cognitive 61): MySqlCreateTableParser.parseConstraint has cognitive complexity 61 (threshold 15). Drivers by points: if/else 60, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"7874a135cc956511ad44ceeda35dfdcca408a8fa51192815d89779a78f90ca9b"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableParser.parsePartitionBy (cognitive 61): MySqlCreateTableParser.parsePartitionBy has cognitive complexity 61 (threshold 15). Drivers by points: if/else 48, loops 12, boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6227acc7f19561865e1c4c9f4934e7fab4a30b498e29b6a994f786fe41e0f63"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseInterval (cognitive 61): MySqlExprParser.parseInterval has cognitive complexity 61 (threshold 15). Drivers by points: if/else 60, boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4a62a5b2cc664da266e6984820e0516c66cec76dc27b61fc35cc4a967bb693"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.visit (cognitive 61): SchemaStatVisitor.visit has cognitive complexity 61 (threshold 15). Drivers by points: if/else 58, boolean chains 3 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a409bf7f31951eda97816348289bfc5f703364b7204aef45aeb2f40db7f28b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveLexer.scanString (cognitive 60): HiveLexer.scanString has cognitive complexity 60 (threshold 15). Drivers by points: if/else 46, loops 7, boolean chains 4, match/switch 3 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6caad7befa8006bae32c608fcceb36cad33e55174916df4510c4af9438062d6"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 60): OracleOutputVisitor.visit has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 40, if/else 18, loops 2 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb4785325aff5cc825e41b9606658cf506603aaec373ec26e65f86ebd8af761"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParser.as (cognitive 60): SQLParser.as has cognitive complexity 60 (threshold 15). Drivers by points: if/else 48, match/switch 5, boolean chains 4, loops 3 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc6ee4e281ef0393c6a226db28403f05da9a46fa0659296dc094d00358179b3"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseFlush (cognitive 59): MySqlStatementParser.parseFlush has cognitive complexity 59 (threshold 15). Drivers by points: if/else 50, loops 7, boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5545960f265e2b6274b21e5524df17d32b30bbedb1abd993153184459e5f77"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parseInsert (cognitive 59): OdpsStatementParser.parseInsert has cognitive complexity 59 (threshold 15). Drivers by points: if/else 55, boolean chains 2, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f09faf4e708f03682e12cfaeb46cfd411ae49417a7e9c3cde1bfe6b2c95ff1c"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUtils.getLastPacketReceivedTimeMs (cognitive 59): MySqlUtils.getLastPacketReceivedTimeMs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 36, error handling 18, boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5707985afabb32bc8c2e536463ede26f91b5ee203bf63685e29f033a5cb957"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateTableSpace (cognitive 58): MySqlStatementParser.parseCreateTableSpace has cognitive complexity 58 (threshold 15). Drivers by points: if/else 57, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"637543b53d266204b79a8ee3b07f4397dab5b9cf623c1a4906ca4d18cf0627bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanAlias (cognitive 58): Lexer.scanAlias has cognitive complexity 58 (threshold 15). Drivers by points: if/else 52, match/switch 3, loops 2, boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"d824a9dfaedeedc677f498116e130a8511a847f69cb889aa5178d7402af5b275"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.alterTableAfterName (cognitive 58): SQLStatementParser.alterTableAfterName has cognitive complexity 58 (threshold 15). Drivers by points: if/else 53, boolean chains 2, match/switch 2, loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4c81c180eab8456589e0ba4d20841b2abdc61df3c577bc1f4ae0e964d4ca74"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 58): SchemaResolveVisitorFactory.resolve has cognitive complexity 58 (threshold 15). Drivers by points: if/else 54, boolean chains 2, loops 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e2580697007a8228eaa2e768c16a14ea2f13a5f4b7f9da35a3f3b9e970849"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 58): SQLASTOutputVisitor.visit has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27, ternaries 25, boolean chains 4, loops 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9871}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009aad90fad4f2b505dc6f71888e0c8dfec9cdca4f7bdecc1a19a6c9b764d27"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.visit (cognitive 58): SQLEvalVisitorUtils.visit has cognitive complexity 58 (threshold 15). Drivers by points: if/else 46, boolean chains 8, match/switch 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1934c46ee3e62e818808b19964cc797de702242f788e2fa1b0e5342123a392"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.addWhere (cognitive 57): SQLSelectQueryBlock.addWhere has cognitive complexity 57 (threshold 15). Drivers by points: if/else 37, loops 19, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4efe386ae3ee7e7971606004fb4b418a65c8f77d92e33fc1fe2598e8ee02d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.addWhereForDynamicFilter (cognitive 57): SQLSelectQueryBlock.addWhereForDynamicFilter has cognitive complexity 57 (threshold 15). Drivers by points: if/else 40, loops 16, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"626b989ad30f2ba143b77c29aabf6381c93ff9e5b37591b6bf38bf0a3b8058c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.equals (cognitive 57): SQLSelectQueryBlock.equals has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 31, if/else 25, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d7c9f3e7d308b78b01e6e0e9d65be4f9b02c486e87868f12df45e4b7089cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParserUtils.split (cognitive 57): SQLParserUtils.split has cognitive complexity 57 (threshold 15). Drivers by points: if/else 50, boolean chains 6, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"4269c1213f2642f02beae4d7e4fa92ddf7489d114cc69a2791f917daa7e26860"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.getValue (cognitive 57): WallVisitorUtils.getValue has cognitive complexity 57 (threshold 15). Drivers by points: if/else 50, boolean chains 7 (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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9574b533a71bf55998b8df2a7e9f0e4d409e4eb3b8e122fe7fc008c1a980c908"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.getConnectionDirect (cognitive 56): DruidDataSource.getConnectionDirect has cognitive complexity 56 (threshold 15). Drivers by points: if/else 50, boolean chains 3, error handling 2, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a228d8305d7f3ed181aee74df61ac41f7b48b0c060218d41acf4b77f9fdfa623"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseDataType (cognitive 56): OracleExprParser.parseDataType has cognitive complexity 56 (threshold 15). Drivers by points: if/else 53, boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"458e91fc02ccc75788191366380708cdadeb57403010807c28c39dfe9eda7525"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.andRest (cognitive 56): SQLExprParser.andRest has cognitive complexity 56 (threshold 15). Drivers by points: if/else 46, boolean chains 5, loops 5 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d915b297ba1bc5e407eb398f0cd39babf48c2818529639d83833405e0f1ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseSelectOrderByItem (cognitive 56): SQLExprParser.parseSelectOrderByItem has cognitive complexity 56 (threshold 15). Drivers by points: if/else 51, loops 3, boolean chains 2 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85abaa135e8176b515ecefd5d2bb6e4f3d472022b22ceca4086f645d1e7e83d"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.check (cognitive 56): WallVisitorUtils.check has cognitive complexity 56 (threshold 15). Drivers by points: if/else 47, boolean chains 5, loops 4 (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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af3e52b4b3bfbe402bbb530fc8cd3d28e8dbf1844a24e0a9cb22782d5730abc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 55): SQLASTOutputVisitor.visit has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 31, if/else 22, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6875}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa65f9d6cb130ae3c34a0245ae730c11e479a71ae6130382eb13013965c7a94"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 55): SQLASTOutputVisitor.visit has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 33, if/else 22 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9213}}}],"partialFingerprints":{"codehealthFindingId/v1":"855abcfb5fb5dd3af8fa95261cad46794585ad0dd90bd8c44648044bb33bb9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkUnion (cognitive 55): WallVisitorUtils.checkUnion has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30, boolean chains 17, loops 8 (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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"20799b64662eb12b530032e5c59ffa58b5a30e0777b52628e1f78aea6d7ea6cf"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateConnectionTask.runInternal (cognitive 54): CreateConnectionTask.runInternal has cognitive complexity 54 (threshold 15). Drivers by points: if/else 35, error handling 10, boolean chains 8, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5854ed5836368bba999830a728f811bad038479265645cbf2bae097f8eba3b1"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlShowColumnOutpuVisitor.visit (cognitive 54): MySqlShowColumnOutpuVisitor.visit has cognitive complexity 54 (threshold 15). Drivers by points: if/else 47, loops 6, boolean chains 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlShowColumnOutpuVisitor.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"685bca810c8678ea58e27139c0e6f49052299036a38a9e251e52b0e32a1f1b04"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseCreateMaterializedView (cognitive 54): SQLStatementParser.parseCreateMaterializedView has cognitive complexity 54 (threshold 15). Drivers by points: if/else 47, loops 4, boolean chains 3 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4345}}}],"partialFingerprints":{"codehealthFindingId/v1":"024908d09817c67a4636a2c0c8c9cbef99eeca931c1dfdd607de5f84c1074366"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLDateExpr.check (cognitive 53): SQLDateExpr.check has cognitive complexity 53 (threshold 15). Drivers by points: if/else 51, boolean chains 1, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f98979285552e835e2e5457f79a0e2e1b6b35b3e2484f639fc868dba9df408"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLTimestampNTZExpr.check (cognitive 53): SQLTimestampNTZExpr.check has cognitive complexity 53 (threshold 15). Drivers by points: if/else 51, boolean chains 1, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b51ef5c28c320ae82f67bf24949b9e00a4fc67ccab83e0ec4120c95ce5dedd"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.equalsForMergeJoin (cognitive 53): SQLSelectQueryBlock.equalsForMergeJoin has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 28, if/else 24, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"747506980aa78470b498ae7bdbd39a5e3d260d24244645f4241f820bb341d6d8"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseLoadDataInFile (cognitive 53): MySqlStatementParser.parseLoadDataInFile has cognitive complexity 53 (threshold 15). Drivers by points: if/else 52, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f575bd7b374dfd55b2ad678486ab3834a457e0d20a3694ead5ee2ad01f0f9681"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseCreatePackage (cognitive 53): OracleStatementParser.parseCreatePackage has cognitive complexity 53 (threshold 15). Drivers by points: if/else 47, loops 6 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ac3d8a864a77842026d8c1e39b525b84c8b963d381ca398349d2a5d5ac2336"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 53): OscarOutputVisitor.visit has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 31, if/else 21, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b65932ceb95821e518323ee0e639800642f2b12bfd6f8eb7cf8d1d02d1459db"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseInsert (cognitive 53): PGSQLStatementParser.parseInsert has cognitive complexity 53 (threshold 15). Drivers by points: if/else 46, loops 7 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec03c9c3d05976a25a3ef787d435091b063cbfeb9b547138e0bf9ac889638515"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSourceStatLoggerImpl.log (cognitive 52): DruidDataSourceStatLoggerImpl.log has cognitive complexity 52 (threshold 15). Drivers by points: if/else 50, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSourceStatLoggerImpl.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8b3bd90d4ef3e1f70af49d8204d05da7e7b63c379e729ce6a855c1f47be035"}},{"ruleId":"D2","level":"warning","message":{"text":"ImpalaCreateTableParser.parseCreateTableRest (cognitive 52): ImpalaCreateTableParser.parseCreateTableRest has cognitive complexity 52 (threshold 15). Drivers by points: if/else 44, boolean chains 6, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"974b548d490262d87faf13f96454dc32b26b8c5efd529ac7da20fe20e53b7b74"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseSet (cognitive 52): MySqlStatementParser.parseSet has cognitive complexity 52 (threshold 15). Drivers by points: if/else 52 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47e970e9b471fe4067be4126b44b07ae6e47d0a7c669b122eadf0c8d5df848f"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarStatementParser.parseInsert (cognitive 52): OscarStatementParser.parseInsert has cognitive complexity 52 (threshold 15). Drivers by points: if/else 45, loops 7 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"47573788b3242d02494eb6ccac6a3d8117967060d8c0d031e86f8ab3af0e8eeb"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseTruncate (cognitive 52): SQLStatementParser.parseTruncate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 43, loops 9 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3674}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae111914be801254a2286656083316879ffc9195a90b251297dd78872e9a7e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlTypeUDF.getStmtSqlType (cognitive 52): SqlTypeUDF.getStmtSqlType has cognitive complexity 52 (threshold 15). Drivers by points: if/else 39, ternaries 12, 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":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlTypeUDF.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a36170946002924761e600922e8b7650a305c4ee84b585f775f0860fb2becf3"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkSelectForMultiTenant (cognitive 52): WallVisitorUtils.checkSelectForMultiTenant has cognitive complexity 52 (threshold 15). Drivers by points: if/else 48, boolean chains 4 (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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8106e01f394f226f443fa79207e3259cc5a30a6d14b5a6c6cd1440c03062f179"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.configFromPropertiesAfterInit (cognitive 51): DruidDataSource.configFromPropertiesAfterInit has cognitive complexity 51 (threshold 15). Drivers by points: if/else 26, boolean chains 8, ternaries 7, error handling 6, loops 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"676c205d91979d288bb1612966c169a03853d10a79d15049dc9d0f7f1df5b922"}},{"ruleId":"D2","level":"warning","message":{"text":"BigQueryLexer.scanAlias (cognitive 51): BigQueryLexer.scanAlias has cognitive complexity 51 (threshold 15). Drivers by points: if/else 42, loops 4, match/switch 3, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f6d1065393ba825d571da76a6ebb755d657a612e407c91b75d40206c2bba78"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanString2_d (cognitive 51): Lexer.scanString2_d has cognitive complexity 51 (threshold 15). Drivers by points: if/else 47, boolean chains 2, loops 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b113fb4188ea7a215c9c1efcfd4f1f38f2fe8299398cb3070787b5d75b8f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.alterTableSet (cognitive 51): SQLStatementParser.alterTableSet has cognitive complexity 51 (threshold 15). Drivers by points: if/else 40, loops 11 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"9714acfe32300d118372fd5f4ca492de2dbb74aa0f089142e102e728534dae88"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseCreateView (cognitive 51): SQLStatementParser.parseCreateView has cognitive complexity 51 (threshold 15). Drivers by points: if/else 46, boolean chains 3, loops 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5002}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d24872f2036cf39c9d7316238d1871358f5d5a0d040de0244b73ebeacb71c26"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateConnectionThread.run (cognitive 50): CreateConnectionThread.run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 27, error handling 14, boolean chains 8, 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"6658de83f7efe39023aa5f596968ec339bf55031a875f1e28cde6d94dd71d4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlLexer.skipFirstHintsOrMultiCommentAndNextToken (cognitive 50): MySqlLexer.skipFirstHintsOrMultiCommentAndNextToken has cognitive complexity 50 (threshold 15). Drivers by points: if/else 40, boolean chains 9, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c00d391cecda068195cbfbe11add9f2bbf67d1f147ecddb5cbf32531d2d8e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectParser.parseTableSourceRest (cognitive 50): MySqlSelectParser.parseTableSourceRest has cognitive complexity 50 (threshold 15). Drivers by points: if/else 40, boolean chains 5, match/switch 5 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb656e752d5be8c2fd3aa55ddaddac13a6d2d70f98fb48d2d098760e794cda6"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 50): MySqlOutputVisitor.visit has cognitive complexity 50 (threshold 15). Drivers by points: if/else 28, ternaries 11, loops 10, boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e9bd253e0091ceb04935620317a555b18e5f469305c689edff48a8e4bb32e9"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 50): OracleOutputVisitor.visit has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 31, if/else 19 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"43698dea5a193366595a1fbeea3a7defe065e1b40db276cb52dc33f6c4bb0808"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 50): PGOutputVisitor.visit has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 29, if/else 20, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"6542c532c0d6ce5b907de6432174af81e898443570ab93bc70a8018cf43042c3"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaRepository.console (cognitive 50): SchemaRepository.console has cognitive complexity 50 (threshold 15). Drivers by points: if/else 36, loops 13, error handling 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ccea991373ec3db19afd78db51cffa37a24c684d7097382802bea0d84ea137"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 50): SQLASTOutputVisitor.visit has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 32, if/else 18 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6565}}}],"partialFingerprints":{"codehealthFindingId/v1":"171f7965c2a86b66900eef5b71d473dd9e208f68f1f6446eff91cfaa7f754a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLCreateTableStatement.sort (cognitive 49): SQLCreateTableStatement.sort has cognitive complexity 49 (threshold 15). Drivers by points: if/else 32, loops 17 (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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"480e7278234d9a9f4c3c292a6e054f207c0a30695185db9633925f08ff50b45e"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 49): MySqlOutputVisitor.visit has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 25, if/else 19, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd5fcb0781d4e4bc2988347dea74fec832f53d9f054df12ce27da4ab9e7e769"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 49): OscarOutputVisitor.visit has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 27, if/else 19, loops 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"741a395d66a47d2336cf15d6a75f5d6307defa8a87ce29e1ebc050162f3ce680"}},{"ruleId":"D2","level":"warning","message":{"text":"PGExprParser.primaryRest (cognitive 49): PGExprParser.primaryRest has cognitive complexity 49 (threshold 15). Drivers by points: if/else 37, match/switch 7, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"600fb723b7ebcf4bfd10b1036bcdd91bba00140328ea96189b8fd3d456681da2"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSelectParser.parseTableSourceTableSample (cognitive 49): PGSelectParser.parseTableSourceTableSample has cognitive complexity 49 (threshold 15). Drivers by points: if/else 39, boolean chains 5, match/switch 5 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"455456b8d5b7b17027a7f2f34ec04e63134aff6dc64fc8c66de6203fb50f4654"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 49): PGOutputVisitor.visit has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 27, if/else 19, loops 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8ffbf060de741d6dbdf666b49a436d75d5d6a06cf027d0cb504551aaf44f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"BigQueryLexer.scanString (cognitive 48): BigQueryLexer.scanString has cognitive complexity 48 (threshold 15). Drivers by points: if/else 39, loops 4, match/switch 3, boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09545d7c1f018b94cc674ea3990fd942c8682858ada84d0028c236c3331f68f"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 48): OscarOutputVisitor.visit has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 25, if/else 18, boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"526e5a5616ed14f94fa21a827a5cd2e5caf2a3dc7dce3b2331b23c0127348662"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseStatementListNonStandard (cognitive 48): SQLStatementParser.parseStatementListNonStandard has cognitive complexity 48 (threshold 15). Drivers by points: if/else 41, boolean chains 5, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e8a178d80c8bf4a4c1e7c3c872bf8687fe17c08237026419ae80fbab23f752"}},{"ruleId":"D2","level":"warning","message":{"text":"ParameterizedOutputVisitorUtils.parameterize (cognitive 48): ParameterizedOutputVisitorUtils.parameterize has cognitive complexity 48 (threshold 15). Drivers by points: if/else 39, loops 7, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab28f2f71f53218c0adf32d8bd8a7f68bb29b8e0818f8e015f7f9a80c20b9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 48): SQLASTOutputVisitor.visit has cognitive complexity 48 (threshold 15). Drivers by points: if/else 33, ternaries 12, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4531}}}],"partialFingerprints":{"codehealthFindingId/v1":"20031fb0f2c295e315c9430329db6ef1ea763d16b56545001cb36b8e7f279689"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.primaryIdentifierRest (cognitive 47): MySqlExprParser.primaryIdentifierRest has cognitive complexity 47 (threshold 15). Drivers by points: if/else 35, boolean chains 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6f5ee15d2ffab0f4b902e6b716b76f34e8e3ed5dc375769029971f8a32865e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.notRationalRest (cognitive 47): SQLExprParser.notRationalRest has cognitive complexity 47 (threshold 15). Drivers by points: if/else 38, match/switch 7, boolean chains 2 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb935899246e34ea348c51062800e33e33dc408c2922b78f40ae1fe9758417f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseGrant (cognitive 47): SQLStatementParser.parseGrant has cognitive complexity 47 (threshold 15). Drivers by points: if/else 39, loops 4, boolean chains 2, match/switch 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"999016cf1007ab357fd9351514974d66d57ce98f11edfde4cd68e8d2f8de2695"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 47): SQLASTOutputVisitor.visit has cognitive complexity 47 (threshold 15). Drivers by points: if/else 26, ternaries 17, loops 3, boolean chains 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7978}}}],"partialFingerprints":{"codehealthFindingId/v1":"44972eb11eb491ef45381906f238197547889c20f55f3b96fd2443339f2d227c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLUtils._normalize (cognitive 47): SQLUtils._normalize has cognitive complexity 47 (threshold 15). Drivers by points: if/else 41, boolean chains 6 (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":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c949ba864ca1cd13e4454297665297c17ce3b3e4d8af0465365f563e3072ef"}},{"ruleId":"D2","level":"warning","message":{"text":"CalciteMySqlNodeVisitor.visit (cognitive 47): CalciteMySqlNodeVisitor.visit has cognitive complexity 47 (threshold 15). Drivers by points: if/else 35, loops 7, boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53eacaf6e0b0daee596202bd0ec3ff4b88bd712938e847d9a1a6a007542fa88"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectQueryBlock.accept0 (cognitive 46): MySqlSelectQueryBlock.accept0 has cognitive complexity 46 (threshold 15). Drivers by points: if/else 32, loops 14 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSelectQueryBlock.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e2a3598968b206f5420ff1922c40972bac115075e301685cd5a28ab39270f9"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateUser (cognitive 46): MySqlStatementParser.parseCreateUser has cognitive complexity 46 (threshold 15). Drivers by points: if/else 43, boolean chains 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de2be1a4deda6b8f958e033a7b8f0cf4849e4f4024d3b524b87d3482e51bed8"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseDeleteStatement (cognitive 46): MySqlStatementParser.parseDeleteStatement has cognitive complexity 46 (threshold 15). Drivers by points: if/else 44, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b5f5f4989e9e6d46e5ec622ecf7685c3c5c1d716ebd53a4490653b2c924158"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 46): MySqlOutputVisitor.visit has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 24, if/else 20, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d37d26223d8da1989dcc8cf3d8045af2087d9cc475e52e6e00bf32570a0a2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 46): OscarOutputVisitor.visit has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26, ternaries 16, boolean chains 4 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"607db8cefb17b3c523a8443c5bc22d3c6f15fd2c2711d3220ffeb41dcc7a890e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parsePivot (cognitive 46): SQLSelectParser.parsePivot has cognitive complexity 46 (threshold 15). Drivers by points: if/else 37, loops 9 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5af86dc35da7f6a88c2e0c68bd8f43c8c2bbaa71a908a9f4f22c6db384a07b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visitStatementList (cognitive 46): SQLASTOutputVisitor.visitStatementList has cognitive complexity 46 (threshold 15). Drivers by points: if/else 33, loops 12, boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11950}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b60771128595be9e27dde1495692c3cc761ef0cb97b90a51420aca0c0c5e51"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.div (cognitive 46): SQLEvalVisitorUtils.div has cognitive complexity 46 (threshold 15). Drivers by points: if/else 32, boolean chains 12, error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c891b84995b3fc7200ac2f3c44995a6bc1f8581d22ce2b0c735498012c2b81c2"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlLexer.scanString (cognitive 45): MySqlLexer.scanString has cognitive complexity 45 (threshold 15). Drivers by points: if/else 40, match/switch 3, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a64d9ddb7e31b72de9609858e53c4d31996b7bdfaabc7acb732c8e8985c1fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseStorage (cognitive 45): OracleExprParser.parseStorage has cognitive complexity 45 (threshold 15). Drivers by points: if/else 44, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f796932424e3f37692509768111407cbb47a615cc739559540e5eb8022297ec"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 45): OracleOutputVisitor.visit has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 28, if/else 17 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fc53ed7252d34eac649763305fe9cbf2914338785f9b32d290e73fae5cd6a9"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarExprParser.primaryRest (cognitive 45): OscarExprParser.primaryRest has cognitive complexity 45 (threshold 15). Drivers by points: if/else 35, match/switch 6, boolean chains 4 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6840a885243d9c7ff60f81fc8faccec1e8d694261a9e8758cc1cfbfd6d0c3bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 45): SQLASTOutputVisitor.visit has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22, ternaries 20, boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"944bca3dff9bf34cbcde11c462be7c3cb81920f9a9d893c24254364655f69fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 45): SQLASTOutputVisitor.visit has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 27, if/else 14, boolean chains 2, loops 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7019}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ee86fc98ca49755045e30e9dc732e96f08605c8759af0a1673a54d66430993"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.handleCondition (cognitive 45): SchemaStatVisitor.handleCondition has cognitive complexity 45 (threshold 15). Drivers by points: if/else 31, loops 6, boolean chains 5, match/switch 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c98be6c305f509b95ffca5a7d602207f06dde785f296647b7a16f0550f66dc"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseColumnRest (cognitive 44): MySqlExprParser.parseColumnRest has cognitive complexity 44 (threshold 15). Drivers by points: if/else 39, boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6178c21f715801f6f2c7f1ede96e55bb4e9be7a49bff41babdac7c65ab7e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 44): MySqlOutputVisitor.visit has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 26, if/else 16, boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"6895ff1a66d7262f60103ba9501c673f0a0302a52a34e7bc2cff9b3a3ea58787"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 44): MySqlOutputVisitor.visit has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 23, if/else 17, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"8314280b4c0f906aab81083e4c7eb942c9f36959c7a111e2b0bdec0ba4367eec"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectParser.parseTableSourceRest (cognitive 44): OracleSelectParser.parseTableSourceRest has cognitive complexity 44 (threshold 15). Drivers by points: if/else 40, boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"46963850e4069ded9ddbd1cfe003fc8234db6d2b1d23f2f5691c56fb4da55e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 44): PGOutputVisitor.visit has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24, ternaries 16, loops 3, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f088bcf2bd6eaf5e6e685fd8b6d4832583ac9f3df884d07b41060750585cb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"RedshiftCreateTableParser.parseCreateTableRest (cognitive 44): RedshiftCreateTableParser.parseCreateTableRest has cognitive complexity 44 (threshold 15). Drivers by points: if/else 33, loops 9, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/parser/RedshiftCreateTableParser.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcee5232ac2f8852410e5d70670bfc44b494d15bdbefbb08bb153f6a48ebe6c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseTableSourceSampleHive (cognitive 44): SQLSelectParser.parseTableSourceSampleHive has cognitive complexity 44 (threshold 15). Drivers by points: if/else 34, boolean chains 5, match/switch 5 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b4b3d5c4f1a1b4e89dcbcdb809ed91c9e5c81183ab47d8b0ba63043f2eb985"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printMethodParameters (cognitive 44): SQLASTOutputVisitor.printMethodParameters has cognitive complexity 44 (threshold 15). Drivers by points: if/else 38, boolean chains 5, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f459a04f0fb652598bbef3c1942dc0fc311cd4777d5acc64ec6b328326e0df"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLMethodInvokeExpr.computeDataType (cognitive 43): SQLMethodInvokeExpr.computeDataType has cognitive complexity 43 (threshold 15). Drivers by points: if/else 34, boolean chains 9 (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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a509c0f4d195137e6be7e76a7bf54e6ef419305ae818aeb7cb6ffdecbb96b63b"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.alterView (cognitive 43): MySqlStatementParser.alterView has cognitive complexity 43 (threshold 15). Drivers by points: if/else 39, boolean chains 2, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b92ea39f758ecd9a3654cade23ddebc970ee89adae968298848f14b51ab08ae"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseExplain (cognitive 43): MySqlStatementParser.parseExplain has cognitive complexity 43 (threshold 15). Drivers by points: if/else 39, loops 3, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a9b73f21513530377d167e85669df53de0eeb60a9d0f499a23cbafd532b6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerLexer.scanComment (cognitive 43): SQLServerLexer.scanComment has cognitive complexity 43 (threshold 15). Drivers by points: if/else 31, boolean chains 6, loops 6 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerLexer.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"89124404abb35031efdda2f4d0ac1c8e56a1c9d61ae2e2f9784ac8c4967a9209"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksOutputVisitor.printDistributedBy (cognitive 43): StarRocksOutputVisitor.printDistributedBy has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 25, if/else 17, boolean chains 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":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6538f294a7dd5677087da7f3ede72550b400ec6495528d1228e5175087e704"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printFetchFirst (cognitive 43): SQLASTOutputVisitor.printFetchFirst has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 21, if/else 19, boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6171b61df3545373940887b294e6a05b25d7350930f7f5a845f60e989dd9bec"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLUtils.toSQLString (cognitive 43): SQLUtils.toSQLString has cognitive complexity 43 (threshold 15). Drivers by points: if/else 33, loops 9, boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa1cb7a5432f517a480a2b4ab24fba273851b6d182b9b3204713470de9bac74"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.recycle (cognitive 42): DruidDataSource.recycle has cognitive complexity 42 (threshold 15). Drivers by points: if/else 36, boolean chains 5, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef69718f136c83ea2eb06f6862908c870008edd9664f1bba107d2ad3a13a2c00"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBinaryOpExpr.computeDataType (cognitive 42): SQLBinaryOpExpr.computeDataType has cognitive complexity 42 (threshold 15). Drivers by points: if/else 33, boolean chains 8, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"74367b8b86e35088901983541bd0f9ee765c025522b33a8581901106f653b2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2ExprParser.parseIdentity (cognitive 42): DB2ExprParser.parseIdentity has cognitive complexity 42 (threshold 15). Drivers by points: if/else 42 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ccc3c246bcc1791a1da9da4ce581bbec216af55c86e66f0e220857f2a31ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"H2ExprParser.parseIdentity0 (cognitive 42): H2ExprParser.parseIdentity0 has cognitive complexity 42 (threshold 15). Drivers by points: if/else 42 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2ExprParser.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3662eaa9b1afdc5a832f59e754f3fdbc6ac28f50d954666fa09a3f15ab20dbf5"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseAnalyze (cognitive 42): MySqlStatementParser.parseAnalyze has cognitive complexity 42 (threshold 15). Drivers by points: if/else 31, loops 11 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbb98addeb49d1618b1de30d49778f98460dcb791f88fd28acd3d87986102fd"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsLexer.scanIdentifier (cognitive 42): OdpsLexer.scanIdentifier has cognitive complexity 42 (threshold 15). Drivers by points: if/else 31, boolean chains 6, loops 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsLexer.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e01fc64263b141018f9d29b9d8c08e54ff063a934cd8b68154b92141286a2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleLexer.scanComment (cognitive 42): OracleLexer.scanComment has cognitive complexity 42 (threshold 15). Drivers by points: if/else 30, loops 6, boolean chains 4, ternaries 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"25501ab63a8556dc03674d2c176f820804476b69d17ad783253f869ade53532e"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 42): OscarOutputVisitor.visit has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 27, if/else 15 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"def2d0740d45837aac3cbb979d11be6b077b7910bdcf732ee5493397466877fa"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 42): PGOutputVisitor.visit has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 27, if/else 15 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a601182bedb14293aae6824621998e64f823f5712e11b935fa6f8d2ecb6e15"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeCreateTableParser.parseCreateTableRest (cognitive 42): SnowflakeCreateTableParser.parseCreateTableRest has cognitive complexity 42 (threshold 15). Drivers by points: if/else 38, loops 4 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeCreateTableParser.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"911f27199960a6f4b5f3ae8b1d96c38420b4703826a96d42b42b3e7b7cd8abaf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerStatementParser.parseDeclare (cognitive 42): SQLServerStatementParser.parseDeclare has cognitive complexity 42 (threshold 15). Drivers by points: if/else 35, loops 5, boolean chains 2 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75ecf6abf0c6a3739fb9c4800eb50907cc9da23f83002337bcec6d120afebdf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseHiveInsertStmt (cognitive 42): SQLStatementParser.parseHiveInsertStmt has cognitive complexity 42 (threshold 15). Drivers by points: if/else 33, boolean chains 5, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab063aaca73cccddf71e58fd4ad530aab1c088edbd9c2d033c8d564f97f46e5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnvHash.hashCode64 (cognitive 42): FnvHash.hashCode64 has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18, boolean chains 12, ternaries 8, loops 4 (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":"core/src/main/java/com/alibaba/druid/util/FnvHash.java"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ff79d3edb2504980d685643fe2412bc321089d344b8eba9df890f1730b94a5"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBinaryOpExpr.split (cognitive 41): SQLBinaryOpExpr.split has cognitive complexity 41 (threshold 15). Drivers by points: if/else 39, loops 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eacc7f83cbe50c99f0ef8791d1b26ada0edd4db18f261d64c8d4eee61d14e5"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleCreateTableParser.parseCreateTableSupplementalLoggingProps (cognitive 41): OracleCreateTableParser.parseCreateTableSupplementalLoggingProps has cognitive complexity 41 (threshold 15). Drivers by points: if/else 36, loops 5 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9c18fbfbc809e3147cdcef2df407001cf81f0a81ec258ecd86bb525d4c112c"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectParser.select (cognitive 41): OracleSelectParser.select has cognitive complexity 41 (threshold 15). Drivers by points: if/else 39, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4c6064e94eafac7192eb62f8c4ca17b84c14a74988e8e651934102c653af32"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 41): OracleOutputVisitor.visit has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 29, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc97d666c6df5b2b0f9c7bcdb2406888d0aef8e583225d2b07214e985a143518"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.orRest (cognitive 41): SQLExprParser.orRest has cognitive complexity 41 (threshold 15). Drivers by points: if/else 32, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f311ca8068ea5c83ccfea4a04e40915ea0f323eda0fa1f98ade5b73c7b208852"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.primaryIdentifier (cognitive 41): SQLExprParser.primaryIdentifier has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21, boolean chains 18, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"e871c775e580162dda87127b27df46edaae5710c1014307ea9b79f101488d684"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.alterMaterialized (cognitive 41): SQLStatementParser.alterMaterialized has cognitive complexity 41 (threshold 15). Drivers by points: if/else 36, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7587}}}],"partialFingerprints":{"codehealthFindingId/v1":"42269110c90d7afb1928493c821c039852d5fd74993820692edc1d40f655caba"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.alterSequence (cognitive 41): SQLStatementParser.alterSequence has cognitive complexity 41 (threshold 15). Drivers by points: if/else 37, boolean chains 3, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7356}}}],"partialFingerprints":{"codehealthFindingId/v1":"642f1187fef10f6ebcfb92f1132b36cc30686bf3fbfdce496eaeb12eed1b466b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printInteger (cognitive 41): SQLASTOutputVisitor.printInteger has cognitive complexity 41 (threshold 15). Drivers by points: if/else 35, boolean chains 6 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca7782033c5eedadd65f349e2c3fef7db52f5badb0bc345f883eeb00790a3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.visit (cognitive 41): SchemaStatVisitor.visit has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25, loops 12, boolean chains 4 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d72acff357e9e1b947da122a62b3fdbe9d2a12a938a4412281f2d9e65d5180e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeStatVisitor.preVisit (cognitive 41): CodeStatVisitor.preVisit has cognitive complexity 41 (threshold 15). Drivers by points: if/else 37, loops 4 (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":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlCodeStat.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"07884eaa599246a17e36417f48ac2adff3757ed91ea73b86dc66dd9d6cdb8b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseReplace (cognitive 40): MySqlStatementParser.parseReplace has cognitive complexity 40 (threshold 15). Drivers by points: if/else 31, loops 8, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4135}}}],"partialFingerprints":{"codehealthFindingId/v1":"545da6a13427f26625152f526f8384db1cf3124a26779da6310764feb41a90fb"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.printCreateFunctionBody (cognitive 40): OracleOutputVisitor.printCreateFunctionBody has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 20, if/else 18, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd73c762ffb3ff88546bfcf86cd3fa055f0d0cc4c9af125fba6c51a6b888dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanIdentifier (cognitive 40): Lexer.scanIdentifier has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20, boolean chains 9, ternaries 6, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2585}}}],"partialFingerprints":{"codehealthFindingId/v1":"259125e31073772303e9e9e9420740bbbb75e44c6708e72366c74a3b66e4a55b"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanIdentifier0 (cognitive 40): Lexer.scanIdentifier0 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20, boolean chains 9, ternaries 6, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2721}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8d2d00f296609c5235b37e7ba2f55d7860f58149ecdee30fc116bed3522212"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.expr (cognitive 40): SQLExprParser.expr has cognitive complexity 40 (threshold 15). Drivers by points: if/else 30, boolean chains 10 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6552f13766b46922a3829098fa4ee250fab5fb5a7bfea50ca79f7a01f6a1cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.initExceptionSorter (cognitive 39): DruidDataSource.initExceptionSorter has cognitive complexity 39 (threshold 15). Drivers by points: if/else 34, boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcec75baea1765b57b64cf999468df775fe009c38910a05f7b393e0d79ee6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseAssignItem (cognitive 39): MySqlExprParser.parseAssignItem has cognitive complexity 39 (threshold 15). Drivers by points: if/else 34, ternaries 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbef86e7b89c8c9d46bf40c68817b8d4759780ed65307ca3b358949103441a5"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolveVisitor.visit (cognitive 39): NameResolveVisitor.visit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 32, boolean chains 6, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/transform/NameResolveVisitor.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b13104d83b892d65d72ce7291e947ad57aa80bbe89f66fe1092c88e7fd79a2"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 39): MySqlOutputVisitor.visit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18, ternaries 17, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe8926a8492ffbd70f5b6368e68535bb56ac26d42cb246b90a0e46edf86028"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 39): OracleOutputVisitor.visit has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 24, if/else 14, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec33e51009b65bb055fa1b2cc4336c288574ddc7beb0ad7d62341b432c8a61f"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.printOnConflict (cognitive 39): PGOutputVisitor.printOnConflict has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 20, if/else 14, boolean chains 5 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f13d9d60717cf4e3423b2d0cdcbcb007dafafec3f084c2dbef37af58f0920b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParserUtils.removeComment (cognitive 39): SQLParserUtils.removeComment has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26, boolean chains 7, loops 6 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"571002507b360fad476a638b42ffe71ec79ffd3d71703f719db7c5bda7c838f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseWhere (cognitive 39): SQLSelectParser.parseWhere has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26, loops 4, boolean chains 3, error handling 3, match/switch 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"9480e3d1f28aa9354eeba62312a08ecb0723f833baa11caed7d56a234f2f3ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 39): SchemaResolveVisitorFactory.resolve has cognitive complexity 39 (threshold 15). Drivers by points: if/else 27, loops 12 (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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"908f089da91fdbb878d4b6959606266855b7c0d319e3f8a84750ee57248cfae5"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseCreateType (cognitive 38): OracleStatementParser.parseCreateType has cognitive complexity 38 (threshold 15). Drivers by points: if/else 36, boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":3061}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0d8d90d79d05dc2e9552d8a6d49db5529b4e667f539aa73c90476be8d4b8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Substring.eval (cognitive 38): Substring.eval has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31, boolean chains 6, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Substring.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4aefdfafe331c51505451d9844d70414cd8c82ec5e505d27833a975a6121e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 38): SQLASTOutputVisitor.visit has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 24, if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5984}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48ea5bb5b1deedfa37bd45f5d2d82cd0e0df383d9282e7b8fd490ffb8b0a6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.like (cognitive 38): SQLEvalVisitorUtils.like has cognitive complexity 38 (threshold 15). Drivers by points: if/else 33, boolean chains 4, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23da09115481f4f26ca5531b7948c506834a218e9c05f2b78895e787d2a4b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.check (cognitive 38): WallVisitorUtils.check has cognitive complexity 38 (threshold 15). Drivers by points: if/else 30, loops 5, boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8e2dc50f98f42fbc9413b6f261206f8e7fdbe7aa6f8720696f3ec4abce9c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.isWhereOrHaving (cognitive 38): WallVisitorUtils.isWhereOrHaving has cognitive complexity 38 (threshold 15). Drivers by points: if/else 36, boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d07e119758f43811ad99027083d32d026648261eef20297ea02c70ebac255f"}},{"ruleId":"D2","level":"warning","message":{"text":"AthenaCreateTableParser.parseCreateTableRest (cognitive 37): AthenaCreateTableParser.parseCreateTableRest has cognitive complexity 37 (threshold 15). Drivers by points: if/else 30, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcee3cc10c81f8e3f148c4c2cc64af3ba6c929281831672f5a73f051f7b3b81"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2SelectParser.query (cognitive 37): DB2SelectParser.query has cognitive complexity 37 (threshold 15). Drivers by points: if/else 35, boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe6a36732d226159f1f5a824f4813d02985bcbacfc691ef70822149437159d0"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 37): MySqlOutputVisitor.visit has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 25, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9cc1907ee1031608d93b37b88b5486f50e47a529427672c649fb27a40e1088"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 37): PGOutputVisitor.visit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21, ternaries 12, boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e57d2ca3f83cf46fe9fe7f8a56944716deb26142266819115fe0586484df9f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerSelectParser.select (cognitive 37): SQLServerSelectParser.select has cognitive complexity 37 (threshold 15). Drivers by points: if/else 32, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerSelectParser.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd4067f238cf925d1432dfc278368337aee4b4003326347c701f73cd89ea2db"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerStatementParser.parseSet (cognitive 37): SQLServerStatementParser.parseSet has cognitive complexity 37 (threshold 15). Drivers by points: if/else 36, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35c7f5b3981d09726969a631f62603eb7bbbbc2b958f6388a271e65ecd2b358"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanString2 (cognitive 37): Lexer.scanString2 has cognitive complexity 37 (threshold 15). Drivers by points: if/else 35, loops 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbbed98c56f324de955163de9c308a619045798d6d85891eceb9f98b7e2c0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.dotRest (cognitive 37): SQLExprParser.dotRest has cognitive complexity 37 (threshold 15). Drivers by points: if/else 33, boolean chains 4 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a0e105c2b9b9d8c8a821c4d3640ef6efd36e1c97700558164264969a029f95"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseGroupByItem (cognitive 37): SQLSelectParser.parseGroupByItem has cognitive complexity 37 (threshold 15). Drivers by points: if/else 34, loops 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dfec27fcfc20459425da05d5277f0f0e3ada533e19901391fc8e743c9b557a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printMethodParameters (cognitive 37): SQLASTOutputVisitor.printMethodParameters has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 19, if/else 17, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"e445ea4d5aeaccd142d90b975602317bb848803641e89f747e21c41f22bc5dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 37): SQLASTOutputVisitor.visit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18, ternaries 13, boolean chains 4, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8138}}}],"partialFingerprints":{"codehealthFindingId/v1":"420bf6d522cfee90e5e2ed0d86f9e5e0bed20c8c57f97ce27704a19cdc7b2846"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 37): SQLASTOutputVisitor.visit has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 20, if/else 13, boolean chains 2, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5588}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a87da95a714943004fbec90f0dce1b51bad10dac4506acfffa1524090ddc231"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.getValue (cognitive 37): WallVisitorUtils.getValue has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22, match/switch 8, boolean chains 7 (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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"164438752e7ff97a271cf09f31a1c157b72f3771712e95f94504497642b6cfba"}},{"ruleId":"D2","level":"warning","message":{"text":"DmOutputVisitor.visit (cognitive 36): DmOutputVisitor.visit has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 18, if/else 16, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3911c76f71a4b6f7b57a9c03ec8d91589e414966e5b2442e36990ad7da20c8c4"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 36): MySqlOutputVisitor.visit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 28, boolean chains 5, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2771cba976cae810cc97e24257c60f91cc0d44c7857c64c3789debdf07b1deb"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsExprParser.parseSelectItem (cognitive 36): OdpsExprParser.parseSelectItem has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, boolean chains 7, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"86425e5e92a93dbf8d1e90e939526462ec02d460df308447ea529124cc0e4808"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parsePrivilege (cognitive 36): OdpsStatementParser.parsePrivilege has cognitive complexity 36 (threshold 15). Drivers by points: if/else 32, loops 4 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a145ca42cb35816ae5561c8a85756f504ae4569677b818c0a2c4eba2053e6"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseLobStorage (cognitive 36): OracleExprParser.parseLobStorage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 33, loops 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"add29655d6e29d5a6b50bffb3a59f748d61ceb6399957982a8257ba0352b90f4"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseSegmentAttributes (cognitive 36): OracleExprParser.parseSegmentAttributes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 32, boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc56ae017649ebe2b4f95a3bae039aecd4dfddd137a62561668e36587b9c2d9"}},{"ruleId":"D2","level":"warning","message":{"text":"PGExprParser.primary (cognitive 36): PGExprParser.primary has cognitive complexity 36 (threshold 15). Drivers by points: if/else 29, loops 4, match/switch 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea352034b3c31dea30c717279f714c19dee43097040fd0335f7787583671543c"}},{"ruleId":"D2","level":"warning","message":{"text":"RedshiftOutputVisitor.visit (cognitive 36): RedshiftOutputVisitor.visit has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 24, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/visitor/RedshiftOutputVisitor.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df0d40cb7cea7ba0d402fe1252e16e42c2f4f706659c68fd6e4a3720cadfbc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseCreateSequence (cognitive 36): SQLStatementParser.parseCreateSequence has cognitive complexity 36 (threshold 15). Drivers by points: if/else 32, boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4728}}}],"partialFingerprints":{"codehealthFindingId/v1":"395dcb8a855282134b172e677886c1175947e587d5fa6b1f0b342e2c7effbba3"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 36): SQLASTOutputVisitor.visit has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 26, if/else 10 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11922}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0b846f85a86739094cff281b9328710a5d61968e9704855d0f4051630d2599"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelect.equals (cognitive 35): SQLSelect.equals has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 21, if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelect.java"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"371ff7bd3d1cd8ce14eeec089399340cc615bd427bf1cd76a5084b84c2222406"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.resolveColum (cognitive 35): SQLSelectQueryBlock.resolveColum has cognitive complexity 35 (threshold 15). Drivers by points: if/else 29, loops 5, boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafacbfa4f38c499045bf850f341123f9b2d54c8ba149669747439bfa96448a4"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveExprParser.parseSelectItemRest (cognitive 35): HiveExprParser.parseSelectItemRest has cognitive complexity 35 (threshold 15). Drivers by points: if/else 26, boolean chains 9 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e1b962dc8f63da8739bfe6a7989fa8564d43f65569dfa7d5a5bed60bc0a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 35): MySqlOutputVisitor.visit has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 24, if/else 8, match/switch 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4040}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54047550702b908699eed5f618eb4e165304f3bb1c6a0a9adcd4918c36d441d"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 35): MySqlOutputVisitor.visit has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19, ternaries 16 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ca9897c2dbb8f7a75d43780610f5fac5490a05fa9bde09b40204cbfc255886"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseInterval (cognitive 35): OracleExprParser.parseInterval has cognitive complexity 35 (threshold 15). Drivers by points: if/else 33, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a82ba6da1f23bb7c3d7827f3e4a80267d063a5ab9f12dfb2d422e26ab291c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeStatementParser.parseShow (cognitive 35): SnowflakeStatementParser.parseShow has cognitive complexity 35 (threshold 15). Drivers by points: if/else 29, boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"979dc6c460dad2a9015d96ff802439dadbd4398fa187b95ed02b61d5e3e8c028"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 35): SQLASTOutputVisitor.visit has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 22, if/else 13 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10018}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef237f44506f3cf801a5ebb6eef6f5ded2d02d008d650be700a3364464fdef98"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 35): SQLASTOutputVisitor.visit has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 22, if/else 11, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceaed1301cbc77297baf86f498eac9bf107411d7659509ad5269ac2d3235dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"WallFilter.preprocessResultSet (cognitive 35): WallFilter.preprocessResultSet has cognitive complexity 35 (threshold 15). Drivers by points: if/else 29, boolean chains 5, 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":"core/src/main/java/com/alibaba/druid/wall/WallFilter.java"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6babf5f659c7d758debe3c9f69152baa48b32218e9fd6b28ace4ad27ee0d0bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveOutputVisitor.visit (cognitive 34): HiveOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19, ternaries 12, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dbc61e96e10088ceb4363bab9d61b536cf0e9c1e42c065d090ca3ed3d05c44"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseJsonTableColumn (cognitive 34): MySqlExprParser.parseJsonTableColumn has cognitive complexity 34 (threshold 15). Drivers by points: if/else 26, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"89948d9fccc658767f9591b282677b4419e16919e75b89accab75909b61b1434"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 34): MySqlOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 16, if/else 15, loops 3 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"541e4ea51235d0dba5c47a949f8022965e36c4da18532c31d22df041b0697943"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 34): MySqlOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 21, if/else 13 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c668e4f664bb8d41b7727e69cca4d442adbb21c843983242166c599fcf4df"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 34): MySqlOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 23, if/else 11 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5098}}}],"partialFingerprints":{"codehealthFindingId/v1":"391c1ac512be7ad10dd1ed3c56c97da25ab5891c45bad429141b36a6999d37ba"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 34): OdpsOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17, ternaries 15, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a75503ba4c5ed9bff91ca54de4775b4eb15d902a545ead843653cbf8f61d1db"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseOpaque (cognitive 34): OracleExprParser.parseOpaque has cognitive complexity 34 (threshold 15). Drivers by points: if/else 32, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"80909c3603838747727b5fd2fb7a28f60302787ca59c36a1dc2a14b47d6e5e22"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.relationalRest (cognitive 34): OracleExprParser.relationalRest has cognitive complexity 34 (threshold 15). Drivers by points: if/else 29, loops 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"50889c56b2dd35c6c0ad54017d0475ba37ac5454c6cf998b87210ff39df254f7"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleRowNumToLimit.visit (cognitive 34): OracleRowNumToLimit.visit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 33, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb01638d58cd76a58d2db3e58ada352f5b75ab55cff140f3fc0d75b21784f06"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 34): PGOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 22, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd77cd31719421e11e10eb6ec2b90d0103d380e39a6a5ecf78a49594f9e80b9"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 34): PGOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 22, if/else 10, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3622d3daacb0152cd0eb25692517d0a2c98e32474d8128e1d0b37950386f35e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cognitive 34): SQLServerOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 21, if/else 13 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9af47b567f26077061041412ece808a74e190b4f59d15b8147e9a622e1273c9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLCreateTableParser.createTableBodyItem (cognitive 34): SQLCreateTableParser.createTableBodyItem has cognitive complexity 34 (threshold 15). Drivers by points: if/else 31, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c8287d46855c6b1ab58cc7e111ce596dde2f73779890528c429b7deb6d0072"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.methodRest (cognitive 34): SQLExprParser.methodRest has cognitive complexity 34 (threshold 15). Drivers by points: if/else 34 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"03098fe45d0301aa1cdeca5610449a8d62bca80e6479bdfeb2a63e61a64af308"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 34): SQLASTOutputVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 20, if/else 10, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":12280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0c9b0dae33620b5f44f57eda12dd600d756be388dccfba8be2a2d34a3821e7"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleUnorderedLimitDetectVisitor.visit (cognitive 34): OracleUnorderedLimitDetectVisitor.visit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 28, boolean chains 4, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c351cb78ef919818a7755d277fae73fb9aff7519233b9ff6ec7aba0206391ac"}},{"ruleId":"D2","level":"warning","message":{"text":"WebURIStat.afterInvoke (cognitive 34): WebURIStat.afterInvoke has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27, loops 7 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebURIStat.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0999681a7892089bf50e2cd41d7e22de1c28ba1a021141e003ce852b67b33299"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidAbstractDataSource.validateConnection (cognitive 33): DruidAbstractDataSource.validateConnection has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21, error handling 8, ternaries 3, 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaedff809e5fd814ebe98463d307b4b83684a7e514939f689790ace086415b39"}},{"ruleId":"D2","level":"warning","message":{"text":"ImpalaExprParser.parsePartition (cognitive 33): ImpalaExprParser.parsePartition has cognitive complexity 33 (threshold 15). Drivers by points: if/else 26, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaExprParser.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c684966257901bc9448ce49e482917a51f93c46faac93fe22a6517a7d2daa1"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseFullTextAnalyzer (cognitive 33): MySqlStatementParser.parseFullTextAnalyzer has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21, loops 10, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"713a19689065d7f01c352a0789af8fa1227d1c13c91d57425f17fd9e43e446d4"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 33): MySqlOutputVisitor.visit has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 18, if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33668da179e3601f7f4194aae88b100eadd6a8492bdabaa4ead4ca2aa84c635"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseSet (cognitive 33): PGSQLStatementParser.parseSet has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, loops 6, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3295aef2724bf6ced47c7e94d51b246e5c326e24857295d164c6caaa3bf423a0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cognitive 33): SQLServerOutputVisitor.visit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15, ternaries 13, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b89106ee2636c2aafe957447f8dba14530ecf8bc072b23ba1b0b95d662e8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseAssignItem (cognitive 33): SQLExprParser.parseAssignItem has cognitive complexity 33 (threshold 15). Drivers by points: if/else 25, boolean chains 8 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83a7f428ed9c825185b1a40561304e452404630dee5840d7fe92ce62b91047c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParserUtils.getTables (cognitive 33): SQLParserUtils.getTables has cognitive complexity 33 (threshold 15). Drivers by points: if/else 27, match/switch 3, boolean chains 2, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99af5a1b6c45fae56b76bd274d5730f4e9b3a174e6448b4d2f1fb206f0a5dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseAlterDrop (cognitive 33): SQLStatementParser.parseAlterDrop has cognitive complexity 33 (threshold 15). Drivers by points: if/else 27, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd58220a545083eb43000f8d400e29d36e84e1ed35b7f18c9fef07859499302c"}},{"ruleId":"D2","level":"warning","message":{"text":"ParameterizedOutputVisitorUtils.parameterizeHash (cognitive 33): ParameterizedOutputVisitorUtils.parameterizeHash has cognitive complexity 33 (threshold 15). Drivers by points: if/else 31, loops 1, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb30ab1aa40d9739395597bb4417f64c4a244d6df23f6e93d6a6292f73c4164d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 33): SQLASTOutputVisitor.visit has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 16, if/else 14, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27c6a4cb4efca011930cd6b80d1d9047b683fdd3896730c48cabdf924389ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 33): SQLASTOutputVisitor.visit has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 23, if/else 10 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af062c3c47bfb59714d93c9da0a7daf2d6afdd0724bd7a029969436fe5f6d5"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkConditionForMultiTenant (cognitive 33): WallVisitorUtils.checkConditionForMultiTenant has cognitive complexity 33 (threshold 15). Drivers by points: if/else 32, 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"643f81ae4da9d88315a9aa6f66dc17089922c835b5c1fb60447d52c669b4fdae"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.preVisitCheck (cognitive 33): WallVisitorUtils.preVisitCheck has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc82e9e9d1c604525f2864549d27cb337c53608d5788b9cf656569357533049"}},{"ruleId":"D2","level":"warning","message":{"text":"WallFilter.wallUpdateCheck (cognitive 33): WallFilter.wallUpdateCheck has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28, loops 5 (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":"core/src/main/java/com/alibaba/druid/wall/WallFilter.java"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fa1fef9a7cdc0aa20da38d9af231ee88e5b8d2f0fab520e97925c82e50cc99"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlMockExecuteHandlerImpl.executeQueryFromDual (cognitive 32): MySqlMockExecuteHandlerImpl.executeQueryFromDual has cognitive complexity 32 (threshold 15). Drivers by points: if/else 31, 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":"core/src/main/java/com/alibaba/druid/mock/handler/MySqlMockExecuteHandlerImpl.java"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"38772e3125f6fe3dc8fd1ad2d40504a6c646705293bc677550c0b9105fe44488"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBinaryOpExpr.merge (cognitive 32): SQLBinaryOpExpr.merge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"73154676536e540608155b581d6acfd9c3772bdd098cb765d1fbcbd80fbd7dba"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.cloneTo (cognitive 32): SQLSelectQueryBlock.cloneTo has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23, loops 9 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b43d79e99b266cea29ab6e308b2944ab482b8b44db993bb451ef5db2d504b8"}},{"ruleId":"D2","level":"warning","message":{"text":"DmExprParser.parseInterval (cognitive 32): DmExprParser.parseInterval has cognitive complexity 32 (threshold 15). Drivers by points: if/else 30, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"828ab61dda1a31d6d19da37ad9c8fadb3580449a9c95a16a96e177c2bfef753b"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlInsertStatement.accept0 (cognitive 32): MySqlInsertStatement.accept0 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23, loops 9 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlInsertStatement.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25b6d272b9cca9cba89cf0240c8214030c1f3df38293dcd91b9fc7c66df8c01"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectIntoParser.parseInto (cognitive 32): MySqlSelectIntoParser.parseInto has cognitive complexity 32 (threshold 15). Drivers by points: if/else 31, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"727e3da4f6f8635a3cbfe1da881c4202ec62f20a4de911254fcfb1656108130d"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectParser.parseInto (cognitive 32): MySqlSelectParser.parseInto has cognitive complexity 32 (threshold 15). Drivers by points: if/else 29, loops 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fc9f76c60a8d7e9297e19389f803b69478228b5b3d54fbc31f5bece6fdd61f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 32): MySqlOutputVisitor.visit has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 16, if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a8c9dbeae417393275a550ba9f8d6a1b6dc4c278181704ac0cfd4e817f587f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 32): MySqlOutputVisitor.visit has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 21, if/else 11 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dbd6442813fde9939ed71156ed35134e13dc0a5eb5dac2e10ee51893886a62"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.primary (cognitive 32): OracleExprParser.primary has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26, match/switch 5, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"853d35675828e4cde798157100b49829b8bd7602f2dfc998f1589f6dfb0bffa6"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseAlterTableSplit (cognitive 32): OracleStatementParser.parseAlterTableSplit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 25, loops 7 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a230552688352500f76e56485c309efd27ed1d3b2f91430e05c9aa122027650"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseFunction (cognitive 32): OracleStatementParser.parseFunction has cognitive complexity 32 (threshold 15). Drivers by points: if/else 31, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05fba1ee8a65d0d07cb96cdd280a9345d78c421f12e0450086b1c059746d880"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarExprParser.parseInterval (cognitive 32): OscarExprParser.parseInterval has cognitive complexity 32 (threshold 15). Drivers by points: if/else 30, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"462c9fdbe3fc6f77016c1dc124bf790218ab335fc624ce42c0beb1f9db2a0058"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerStatementParser.parseStatementListDialect (cognitive 32): SQLServerStatementParser.parseStatementListDialect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 29, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6325a924983d52849ac22067b474ebfb0e996beea555aadd96ceae11648ef0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksOutputVisitor.visit (cognitive 32): StarRocksOutputVisitor.visit has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 15, if/else 14, boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"509f745ea73787372342c298b9039a2cfb0b8f96db0d4382c5abbc34ed8c8591"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.nextTokenValue (cognitive 32): Lexer.nextTokenValue has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20, boolean chains 11, 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a64451d1fd9df84735442b496670cb25b7bd0754b110c13516d902d19ecdc6"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseInsert0 (cognitive 32): SQLStatementParser.parseInsert0 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 24, boolean chains 4, loops 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73b5bea39df68918e6be23e2933259a74e6e83d713517427444e9f2d4836719"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.checkParameter (cognitive 32): SchemaResolveVisitorFactory.checkParameter has cognitive complexity 32 (threshold 15). Drivers by points: if/else 30, boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7073e2d1591948bd639f694e0c1397e5cea854fdc0359040f417fe247e4f7d92"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printName (cognitive 32): SQLASTOutputVisitor.printName has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26, boolean chains 3, loops 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"110275947345242083fbd9875b09569a0b4d8916365da48300a5be405610f133"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 32): SQLASTOutputVisitor.visit has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 20, if/else 10, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6814}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cc24d97c9e7b6d3f831672a4e14af413099aa835b0d54f214aaa7961cc08ab"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visitorBinaryRight (cognitive 32): SQLASTOutputVisitor.visitorBinaryRight has cognitive complexity 32 (threshold 15). Drivers by points: if/else 27, boolean chains 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"befd52d966a9fca812d550df66d143819da4f9a9f21d08ad2e9ad1f1790655d9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.add (cognitive 32): SQLEvalVisitorUtils.add has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19, boolean chains 13 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"da94cfd749c674f3bebc8e7b61ec30725e504411ae266f4084ad2ce19db44333"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.eq (cognitive 32): SQLEvalVisitorUtils.eq has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19, boolean chains 13 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"0668056b72e7fc24a15704f81c33b26d8f8e02cd8a4384dc871d677d9367ff78"}},{"ruleId":"D2","level":"warning","message":{"text":"PagerUtils.limitOracle (cognitive 32): PagerUtils.limitOracle has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c56d3db2259472b5c3ad0f34a4fccc3101f9480f6e3e377f18e35b67fa1578"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.check (cognitive 32): WallVisitorUtils.check has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26, boolean chains 4, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"65efc71dc3334f84a0aa9288bd5dc34b50603cd87bde18cf227f1abb47d8fc1b"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidConnectionHolder.\u003Cinit\u003E (cognitive 31): DruidConnectionHolder.\u003Cinit\u003E has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, error handling 9, boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidConnectionHolder.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"151085d6b2d740bb63bcfd5178871451c1cc62e1b579e4c70616e06582c78c18"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLCreateTableStatement.findIndex (cognitive 31): SQLCreateTableStatement.findIndex has cognitive complexity 31 (threshold 15). Drivers by points: if/else 23, loops 8 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a3e0e3ea77537d916c81d3d9b11de8b23583264e1b521a45736ce89373c5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"CKCreateTableParser.parseCreateTableRest (cognitive 31): CKCreateTableParser.parseCreateTableRest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, boolean chains 6, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKCreateTableParser.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7381ee1a03a2b0566069b6a1be239b5c1c0366150aa2b29ddaca028b5641e052"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2OutputVisitor.visit (cognitive 31): DB2OutputVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15, ternaries 11, boolean chains 5 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/visitor/DB2OutputVisitor.java"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad053b8527603d3a709ac1086d8833158425c7813dbdae1c5881399b4bf0c488"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussDbOutputVisitor.visit (cognitive 31): GaussDbOutputVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16, ternaries 11, loops 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c323b5557e59e76cac421e353fa4becf6719bb1dc1fab171e38d07c76e96b7"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.alterDatabase (cognitive 31): MySqlStatementParser.alterDatabase has cognitive complexity 31 (threshold 15). Drivers by points: if/else 28, loops 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8052}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bbb153b1035b496cf3d2249744b0fb9c3f51a9a8ef28ebdbbb27577cb25675"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 31): MySqlOutputVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 18, if/else 11, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89cc174e855bc3a16a212cc0b71e4862a2758372d85dd613cd3bec762ccdf94"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 31): OracleOutputVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 19, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"017a726e6963e62865223c6b4adec64f4a39223a451f5b4a6dbf3ee86a811c57"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSchemaStatVisitor.visit (cognitive 31): OracleSchemaStatVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, loops 10 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleSchemaStatVisitor.java"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6f6cdf46015f092b5c02a1c4b8e8a98f62027d9f63ed4a905bea3e69b02ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 31): OscarOutputVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 19, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c17885bf7befed9584e6016b29bd3318c5fc11468b6d86ca989e8a2a88b1fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 31): PGOutputVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 19, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed65c7f6e070148df70d3990b9fc1e566480afd1818c9f2ae3511de33e76a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.primary (cognitive 31): SQLExprParser.primary has cognitive complexity 31 (threshold 15). Drivers by points: if/else 25, boolean chains 3, match/switch 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"222091c5f5d11a9898849406c6b8d4e7e2eeec276d12732649a433a6d2dc5e47"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printDataType (cognitive 31): SQLASTOutputVisitor.printDataType has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15, ternaries 14, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2bafdb3a370ce6d1cc846d2bb773f39fc66ae3f817c7a8660f848290d3a777"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printParameter (cognitive 31): SQLASTOutputVisitor.printParameter has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, ternaries 8, boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb09df55e7a17fd2470ffcbecd249017f12f1fe76ac442b1167ff736ed135c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printSelectList (cognitive 31): SQLASTOutputVisitor.printSelectList has cognitive complexity 31 (threshold 15). Drivers by points: if/else 25, boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90a75c36bb59d139c49dd7a884e61a41cabcad1d6c46d779ed1b476b7993d97"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 31): SQLASTOutputVisitor.visit has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 17, if/else 12, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2764e2e9bf70dcbfa53af608d7490a205485b740073c09be5f4a85ac41e34148"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidStatService.service (cognitive 31): DruidStatService.service has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, boolean chains 6, ternaries 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/DruidStatService.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae2ece654575284070e056965fc0f72f913f589b39256ffa86ca852ae7c67ef"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUtils.isNumber (cognitive 31): MySqlUtils.isNumber has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24, boolean chains 6, 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":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d42e456602e3c4b7788d50d2b8952f8b107bf8d7e50707b05817a7afdf6ee19"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveOutputVisitor.visit (cognitive 30): HiveOutputVisitor.visit has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 21, if/else 9 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"05533fa1ff0e8fcde0c99da0ebd720f22f9a4717457b32c79dab72f07d481b54"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectIntoParser.query (cognitive 30): MySqlSelectIntoParser.query has cognitive complexity 30 (threshold 15). Drivers by points: if/else 30 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50aac5997b5771a8192a6fd99c38daec7ea47fb0e93dcd5091855ae2dc066e"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 30): MySqlOutputVisitor.visit has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 18, if/else 10, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa2533b516d01339cb573a4d08187bae943a43f3f9f4076b263883088c608be"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 30): OdpsOutputVisitor.visit has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 16, if/else 12, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c967b0b20e0188cf4db4a577b98309587fb399bbf622b08d4d96e474d380311"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleLexer.scanVariable (cognitive 30): OracleLexer.scanVariable has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21, boolean chains 5, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6dfbde22be44f3621c5c14f89ae103387b8c609295575ed68abd0f99f4e27e"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleRowNumToLimit.visit (cognitive 30): OracleRowNumToLimit.visit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22, boolean chains 4, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf764168c2257b78da1d89fe5442475e4d86561f0784f25a521fcbd3f14a3b63"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeSelectParser.parseTableSourceRest (cognitive 30): SnowflakeSelectParser.parseTableSourceRest has cognitive complexity 30 (threshold 15). Drivers by points: if/else 28, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"af98e3a2110e458b611b13272cba3ca6552ffed420a00bd09e32bbe45fb496fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanMultiLineComment (cognitive 30): Lexer.scanMultiLineComment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20, boolean chains 6, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fbdff136be73ed8a6664005143a0f1ce1480c3fcc5a1df47f70760b54b8036"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParser.tableAliasFromOptionalKeyword (cognitive 30): SQLParser.tableAliasFromOptionalKeyword has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17, match/switch 11, boolean chains 2 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9835f15316cb1bc9a5b27f4a9477aca9a6424e8c7de1b59aa74e86462edf23"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseDropTable (cognitive 30): SQLStatementParser.parseDropTable has cognitive complexity 30 (threshold 15). Drivers by points: if/else 25, boolean chains 3, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c739994e9729f195ddc85d2804d66fa1e0047fc7e23dcc68d2c6ef7ca103b3"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printOracleSegmentAttributes (cognitive 30): SQLASTOutputVisitor.printOracleSegmentAttributes has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 18, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9083}}}],"partialFingerprints":{"codehealthFindingId/v1":"30156fb402394ab8e114c373b56485781911d24c588fa5db41d858525c839934"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.sub (cognitive 30): SQLEvalVisitorUtils.sub has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, boolean chains 11 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3fe53142f163532a0f3d1e76c86c8143551f4e1a119840d2189be20929e6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.toString (cognitive 29): DruidDataSource.toString has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18, loops 7, error handling 4 (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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":3354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e16bb90f2a052c19b4f1e0596d5f498a8eae7f377546fdd179638dae97f817"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLColumnDefinition.clone (cognitive 29): SQLColumnDefinition.clone has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, loops 5 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLColumnDefinition.java"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bf4f04cc0a4893b3bf596f9d1272a8a5f6797647e79060e58ce2df6eb702df"}},{"ruleId":"D2","level":"warning","message":{"text":"BigQueryOutputVisitor.visit (cognitive 29): BigQueryOutputVisitor.visit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17, ternaries 11, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b75fef236daa03ede6b2fd79e75ad74ff31594facf12899a75188e2af30225b"}},{"ruleId":"D2","level":"warning","message":{"text":"CKOutputVisitor.visit (cognitive 29): CKOutputVisitor.visit has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 19, if/else 10 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d68ffcea6bb9045de6c450a48652ba2b65bffe4aa107be8e8845702624bb5b"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveOutputVisitor.visit (cognitive 29): HiveOutputVisitor.visit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16, ternaries 11, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a81dc67091bde1180cc9cab0a78a979cb5a7fd7addc8a26d61aba91adff550"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUpdateStatement.accept0 (cognitive 29): MySqlUpdateStatement.accept0 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, loops 6 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlUpdateStatement.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e2f9ee78adf2f98ab2b9e2da9e5df40cf8971e71dc8b2eb47ee51bddfc7066"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.parseSelectItemIdentifier (cognitive 29): MySqlExprParser.parseSelectItemIdentifier has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, boolean chains 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"529b2fb7b426a4ae06a1569aa8d89f11d851bf4d3f9176086e9ca528d5240ebb"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseUsingIndex (cognitive 29): OracleExprParser.parseUsingIndex has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20, loops 8, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1456802a409b9602c2e93741d8fdbc2e8c86dfa3f5d27d5a802997ccc56359e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanLineArgument (cognitive 29): Lexer.scanLineArgument has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19, boolean chains 5, loops 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"8623f4b64cbb3634edc02c8d82bac5984baa427ccc510b9005b4d2af7d615e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseQueryPlanHint (cognitive 29): SQLExprParser.parseQueryPlanHint has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25, boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"635103bf52ba2eeeb2b7411b67a0a136cdedf4327a4776f7e6f88aec93c5e11d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParser.alias (cognitive 29): SQLParser.alias has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, match/switch 5, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d8664bc8c5d825da70e0af22723b0cf2cd02320392012e8c4f2b166cf080b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parserParameters (cognitive 29): SQLStatementParser.parserParameters has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, boolean chains 4, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35a4aa5d6516d1a1279d3004224a40c5fea033d1a5b401a7a79c15167a8b760"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printInsertColumns (cognitive 29): SQLASTOutputVisitor.printInsertColumns has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3820}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ee7f9e8aa06eb5242276dac0c623c520d3d9f6bb3c06c32f7589d32af390e5"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printPartitionsCountAndSubPartitions (cognitive 29): SQLASTOutputVisitor.printPartitionsCountAndSubPartitions has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 19, if/else 10 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25f8315ea3b68a56e7a61e41ebbdf0dbe2a14701e99ad7360d7a64567366ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 29): SQLASTOutputVisitor.visit has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 19, if/else 10 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10884}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e36939e801324c0cea42848feb3b5b9c76cfb51c74e149abfb99e4d486f343"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.isSimpleConstExpr (cognitive 29): WallVisitorUtils.isSimpleConstExpr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25, boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dc0af8fe84d341d0bb239f12aa1cd032f0da084413fe6d9408c00d5c334247"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterManager.loadFilter (cognitive 28): FilterManager.loadFilter has cognitive complexity 28 (threshold 15). Drivers by points: error handling 16, if/else 10, loops 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":"core/src/main/java/com/alibaba/druid/filter/FilterManager.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f0da58796c87c9531f8ce3285217c7b182ffc6887ff2be2c380a24163e122e"}},{"ruleId":"D2","level":"warning","message":{"text":"BigQueryStatementParser.parseCreateFunction (cognitive 28): BigQueryStatementParser.parseCreateFunction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryStatementParser.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfdb47770e55bbeddc693e006984a08840d152a595ee9eda73ec08ed14c8a60"}},{"ruleId":"D2","level":"warning","message":{"text":"DmOutputVisitor.visit (cognitive 28): DmOutputVisitor.visit has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 17, if/else 9, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29dd809b78878db681474f2f1285dac7df2a0ca5c7dfed03b3adc7b01e3ac0e"}},{"ruleId":"D2","level":"warning","message":{"text":"DorisOutputVisitor.visit (cognitive 28): DorisOutputVisitor.visit has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 13, if/else 12, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb6fdf2c106582e1199d15970e50ab702394b26081da11899f87e3ad1804fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussDbExprParser.parsePartitionValues (cognitive 28): GaussDbExprParser.parsePartitionValues has cognitive complexity 28 (threshold 15). Drivers by points: if/else 28 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"205955051fe49ae74d0cef2248d5f43dedf52acf9d8fbed493cc69c78474e1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.methodRestAllowIdentifierMethodSpecific (cognitive 28): MySqlExprParser.methodRestAllowIdentifierMethodSpecific has cognitive complexity 28 (threshold 15). Drivers by points: if/else 27, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc93c671d98e3fce7823042a46f9f2090e7154b6d01759f00f98611065ab53ff"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarLexer.scanString (cognitive 28): OscarLexer.scanString has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, match/switch 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarLexer.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dd211baaa503e276e6b1d108981a1dcf21386d227faba65c41e2d9876c7ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"PGCreateTableParser.parsePartitionBy (cognitive 28): PGCreateTableParser.parsePartitionBy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, loops 6, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a44d0b99a9eb1640f4a39bff7e5a6dbbef3c2af2ba8be1b30022a2ba00337ab"}},{"ruleId":"D2","level":"warning","message":{"text":"PGLexer.scanString (cognitive 28): PGLexer.scanString has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, match/switch 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGLexer.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab39845d750ccf580899ef387dc708bfb907b9bfba607b2674c0f49d304485f2"}},{"ruleId":"D2","level":"warning","message":{"text":"RedshiftOutputVisitor.printInto (cognitive 28): RedshiftOutputVisitor.printInto has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 15, if/else 13 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/visitor/RedshiftOutputVisitor.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8390a5b189afa641d66e30c8202790b6c2d9bddf396f905faaf5207c4a005d"}},{"ruleId":"D2","level":"warning","message":{"text":"TDSelectParser.parseBeforeSelectList (cognitive 28): TDSelectParser.parseBeforeSelectList has cognitive complexity 28 (threshold 15). Drivers by points: if/else 27, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/teradata/parser/TDSelectParser.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dfe5a14bde1555ce9edc3524ba3239812df1d79261241af8572f0e1ff32e11"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseSelectList (cognitive 28): SQLSelectParser.parseSelectList has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c761f31d7bca989cc7c1917c444c8c8daa949ce8a3c000e11078d21d7b1257e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 28): SchemaResolveVisitorFactory.resolve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23, error handling 3, loops 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38332a109b88f7c3a3e8f3f7bbecff4aded1b673127ef07c78f0517274539ee"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 28): SQLASTOutputVisitor.visit has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 17, if/else 10, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11105}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b409604458f446e86640751cddf51718b9e39e54261dc52bdf714649c472be"}},{"ruleId":"D2","level":"warning","message":{"text":"WebStatFilter.init (cognitive 28): WebStatFilter.init has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, boolean chains 4, error handling 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":"core/src/main/java/com/alibaba/druid/support/http/WebStatFilter.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fee1b1014186a0143f894fab02fa33ccb1d33c7be49e38bef1b5f6e29c2723"}},{"ruleId":"D2","level":"warning","message":{"text":"WebStatFilter.init (cognitive 28): WebStatFilter.init has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, boolean chains 4, error handling 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":"core/src/main/java/com/alibaba/druid/support/jakarta/WebStatFilter.java"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e0475f12bf6611bd5f1c4db28360acb26a17153da982acee798842aea5f36"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.isFirstSelectTableSource (cognitive 28): WallVisitorUtils.isFirstSelectTableSource has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, boolean chains 4, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed0fa2176d53f9bacc87beb71c0bd07971eda3bf270fe99b3e4d8407c4c399"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussDbCreateTableParser.parseCreateTableRest (cognitive 27): GaussDbCreateTableParser.parseCreateTableRest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2ef62e6a72ca4e021bfc21b5d5ec0eca642bd5fe0f19b961e33854d6c3990f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 27): MySqlOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, ternaries 6, loops 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6d0bbf8b913989a26b9457f91309b93238da3fe210282e00df8a26cb4bc360"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 27): MySqlOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 19, if/else 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"08723fc6ed96c477ba6e1fe371d3fdafd94fd3c26016dbfb06dafbedb3d9378f"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parseGrant (cognitive 27): OdpsStatementParser.parseGrant has cognitive complexity 27 (threshold 15). Drivers by points: if/else 27 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95c8ea2119dfdefde6ae9f80d9578ec93171adf330f432dd14541a71348c924"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.printConstraintState (cognitive 27): OracleOutputVisitor.printConstraintState has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 16, if/else 11 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d9bed83950c3ba3a574bb7c19757934a2a4618faec34b7558ca8c1ef3c07f3"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 27): OracleOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13, ternaries 12, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"7251058993a65a5fad0d2a87cbb934c15b4daea40225ef046042a09364e5fb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 27): OracleOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 18, if/else 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a044a6182f5ce8e03518c8e46c9c017416a5989d7faee0c77349fb925a21e449"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseAlterColumn (cognitive 27): PGSQLStatementParser.parseAlterColumn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24, boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"687c11bcd91025a45cb85ec9f9156ce6d8d41be355ad2c06a83ddd48eadfc0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"SparkExprParser.primary (cognitive 27): SparkExprParser.primary has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, boolean chains 1, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf9677757eb4ce9636345b9479b2af2f14f40808546641239a5245bcc9e8a85"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cognitive 27): SQLServerOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 14, if/else 10, loops 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db36cc772cad285b851dc7acdd7aa5366f4c9b4ba1a803e5bb4f27ea18b4d72"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseHiveInsert (cognitive 27): SQLStatementParser.parseHiveInsert has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7049}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dab4b872d07e34fbc23650685a298c0cc687d600a3bf39e106ae8ae16c5728"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 27): SQLASTOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13, ternaries 12, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8080}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d57a20507c4405f339694a3e06b4cb45bb086738cf803452927c85cbc4c958"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 27): SQLASTOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 2, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"998a104b6a5188a56f22941723df30c9e88b273ce1e67eb642eeead750f5993b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 27): SQLASTOutputVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 13, if/else 10, boolean chains 2, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1785c024c1197a0eaf7f50cb4a544d907bd89dc19e1256f0a40667d14442481f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlWallVisitor.visit (cognitive 27): MySqlWallVisitor.visit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 4 (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":"core/src/main/java/com/alibaba/druid/wall/spi/MySqlWallVisitor.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fcf3f75f0ba33e43475af27e3617a5c04fda8e6ac1989510799c8900964b68"}},{"ruleId":"D2","level":"warning","message":{"text":"ProxoolDataSource.populatePropertiesFromReference (cognitive 27): ProxoolDataSource.populatePropertiesFromReference has cognitive complexity 27 (threshold 15). Drivers by points: if/else 26, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"druid-wrapper/src/main/java/org/logicalcobwebs/proxool/ProxoolDataSource.java"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e785f3b9143e3ec33f59f4ef052714fa29431e3b7851b14af8f4b2142a6f99da"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLDeleteStatement.removeCondition (cognitive 26): SQLDeleteStatement.removeCondition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDeleteStatement.java"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3a263331a8b0e67d4e62eacf818024611c859cdb0c934be2c5a73de7c63886"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectItem.match (cognitive 26): SQLSelectItem.match has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, loops 4, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectItem.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba519b6af12491d97abfa3ef21217cc27b632bdd62435e8f800fe9d593a88b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.removeCondition (cognitive 26): SQLSelectQueryBlock.removeCondition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27b2d3632a3365069d1e3348e886327b51a7bfa0f04c1d5a3e2c1577bf6e6de"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLUpdateStatement.removeCondition (cognitive 26): SQLUpdateStatement.removeCondition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"92701e3d8b02ddf374eaf58ad8abd526a9978681a0fb45f65e4d0c4523f49564"}},{"ruleId":"D2","level":"warning","message":{"text":"DorisCreateTableParser.parsePartitionBy (cognitive 26): DorisCreateTableParser.parsePartitionBy has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisCreateTableParser.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d7894e875f981e0725a790c618909191d339f682ceb83a3a3b980149e5ee62"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectQueryBlock.equals (cognitive 26): MySqlSelectQueryBlock.equals has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, ternaries 10, boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSelectQueryBlock.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"540f608e465a2ba3bcfe87e4fe121afe56ae6a9b2d5918691c1e4aff1d21cd42"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlLexer.scanVariable (cognitive 26): MySqlLexer.scanVariable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17, loops 8, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f936da10e0fe9393c7651bcfbcc93d7a50080f5139318e343c91ca39a781013c"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseBackup (cognitive 26): MySqlStatementParser.parseBackup has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, loops 8 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"2009f9ee55aa50d6a5e4997b17af1729ea1283dac2b0876c9c7b55070248041b"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 26): OdpsOutputVisitor.visit has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 14, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"918cb118afc7903d5e79d479918b7e1deb285fc56fe50d36846b1235197d519a"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 26): OdpsOutputVisitor.visit has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 16, if/else 9, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb0b3b9888845844ed2fc2c4d245c2756248eb991070d2185ec7fcf1b86b3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseConstraint (cognitive 26): OracleExprParser.parseConstraint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ab2e9e3df3efbc743abc5823bb4da87e83c61d336baefe6ecae8780863ff9c"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 26): OracleOutputVisitor.visit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, ternaries 8 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16ffb2814f7a58eafcd1faab12a434f7241f7189aeb712bdca678640584fb25"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeStatementParser.parseCopyIntoOptions (cognitive 26): SnowflakeStatementParser.parseCopyIntoOptions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, loops 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ac2af48b5d4256a8b569383ee951378b225941f689a781c0780ad9651c03de"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerStatementParser.parseCreateFunctionBody (cognitive 26): SQLServerStatementParser.parseCreateFunctionBody has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7da1d6f27d6b66945faaa89017d2e6f6ec1352f3ea658fabc814c1148a7c15"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseDataTypeRest (cognitive 26): SQLExprParser.parseDataTypeRest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 24, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4660}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f98cff9c72eef3ed3ed953b1aded321cfaf841407449d03f202a4551fe43311"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaRepository.findTable (cognitive 26): SchemaRepository.findTable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3883b905c2e1194453da8811c23f388e9b7f13b292ceac939f0c8bfc1f29717a"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaRepository.findView (cognitive 26): SchemaRepository.findView has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d7173577f6dbe3e9843e4665d8f34cc2234fac171e023c4f86535127f08f1"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 26): SchemaResolveVisitorFactory.resolve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, loops 5 (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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbd86c7a5edb18876f6f625a710fdd33502a414443ba1dbd2d63ef50bd5dbb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 26): SQLASTOutputVisitor.visit has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 14, if/else 12 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10836}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc46c7ca46b73d98d46acae0bb4c1dab7c58eee35f2926a489236a86db15bf4a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 26): SQLASTOutputVisitor.visit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, ternaries 9, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abeccd927b9cab90bc7b986956334a9620922e3ec76149b2883f0a92ae1abe4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.gt (cognitive 26): SQLEvalVisitorUtils.gt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, boolean chains 10 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3b5bd1662329a5207ef27b261c6f03acde421c3c1753c0ce21bca5b1ed1d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"PagerUtils.getLimit (cognitive 26): PagerUtils.getLimit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, ternaries 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"75085b8de26b0bd54eef796ae007f00280d67ef3556ec115290fd4934eb706e8"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONWriter.writeObject (cognitive 26): JSONWriter.writeObject has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, loops 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/json/JSONWriter.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dda1acf33d3e2939a02dae76d89e26c9e0b5ec59bd12f07a9862060e4fdfccc"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkInsertForMultiTenant (cognitive 26): WallVisitorUtils.checkInsertForMultiTenant has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, boolean chains 4, loops 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5a334e9e51560c67fa0fa7b759f91d7fba3dc461f4f07e0c92d0166e3b8663"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLCreateTableStatement.apply (cognitive 25): SQLCreateTableStatement.apply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, loops 5 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40037eaa0d3bd8efab0dbe76d37d970474ee7be37dcb17dfc8f21eed0de30c8"}},{"ruleId":"D2","level":"warning","message":{"text":"BlinkCreateTableParser.parseCreateTable (cognitive 25): BlinkCreateTableParser.parseCreateTable has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, boolean chains 5, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e2d4d867947b49079440c729a6375353e619109a11fd330daae2f5c1755139"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveOutputVisitor.visit (cognitive 25): HiveOutputVisitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 16, if/else 9 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c149d6c6af96b720fd9169a849fb48022a3a85d106905158b3b10efcb94277"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parsePartition (cognitive 25): OracleExprParser.parsePartition has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce024afac33788462803d31f2bfa4fc7e4363b4d8d4e965d224f53b7a69250c"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseExecute (cognitive 25): OracleStatementParser.parseExecute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb35643c3f69f67a6d7b12d7ae401e0f9be17ba1301e104a994492f5eca70bf"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 25): OracleOutputVisitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, ternaries 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"081871136ed2f66db0873a83b3b7f7eb155ade54387e4f48be86bc58f8ceaf13"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 25): OscarOutputVisitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, ternaries 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcf67b6d9dfeb937ab6c9ded431f79977bb3195fa3cd5123a56cd38ef6bfda4"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseParameters (cognitive 25): PGSQLStatementParser.parseParameters has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f1d762d8f28d53b90859ecad793bc0cbe97a3a6c9bc849aea8b19fefc91fca"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 25): PGOutputVisitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, ternaries 12 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"570d1c9fc03a9ed12904d71df9993fc6e65aee3e3ff9aed037544bf3967de05a"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 25): PGOutputVisitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 17, if/else 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2950}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f74db6cc15bda729fb8f6de36d128ebcfb9d97b4d5bd9ca21ccbba887d97c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.multiplicativeRest (cognitive 25): SQLExprParser.multiplicativeRest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80b0e3b3d8be59125706938ab510a41aeab23f6334a8ed165f2353b4940aff4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseCharTypeRest (cognitive 25): SQLExprParser.parseCharTypeRest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4727}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a04b832b349d1e0e5138c6cbf4a1a3aec20deac077ec4f103f0934374b762d6"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseCreateTrigger (cognitive 25): SQLStatementParser.parseCreateTrigger has cognitive complexity 25 (threshold 15). Drivers by points: if/else 23, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0618f029184b0ff3559d12e945a392702aa63078335d469adcb273588bc8de9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseWithQuery (cognitive 25): SQLStatementParser.parseWithQuery has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 4, boolean chains 3, match/switch 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a16e1e7b9bc712348ed2ddd64d3023e4c6484cebf987e2beaca7c3768ebdcdf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 25): SQLASTOutputVisitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, loops 6, ternaries 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b046ef6ea02a184d48c77943cef7e06c45bb46da4a080494a26faa1d071823fa"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 25): SQLASTOutputVisitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, ternaries 7, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9815}}}],"partialFingerprints":{"codehealthFindingId/v1":"52862c77f849f054ac3803d01c2266e602d5d5a1d0455c0531ca116ab584cde2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLUtils.getLimit (cognitive 25): SQLUtils.getLimit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, ternaries 9 (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":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5733ba7683e2e5b546819c8a18ff325591a57f104ff271bf4b8ead9b63fe36"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcStatManager.getSqlList (cognitive 25): JdbcStatManager.getSqlList has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, loops 8, boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/JdbcStatManager.java"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"435356d30e74e6d8ea8e9ecdedce8c5d0b3f9b15cfd1abfed82ee4d18a9726a5"}},{"ruleId":"D2","level":"warning","message":{"text":"WebStatFilter.doFilter (cognitive 25): WebStatFilter.doFilter has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, error handling 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/WebStatFilter.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12e9d99ede36fe2afcb6d4c7da3993fba96e7821019c9279a73de4cc025cdd9"}},{"ruleId":"D2","level":"warning","message":{"text":"WebStatFilter.doFilter (cognitive 25): WebStatFilter.doFilter has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, error handling 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/jakarta/WebStatFilter.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8d3187bfdddfaf6120d2cf8c5a8183e89b0f2f14ad4a090daa35437225a070"}},{"ruleId":"D2","level":"warning","message":{"text":"MonitorDaoJdbcImpl.load (cognitive 25): MonitorDaoJdbcImpl.load has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 6, match/switch 2, error handling 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":"core/src/main/java/com/alibaba/druid/support/monitor/dao/MonitorDaoJdbcImpl.java"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"52657587deb2ae9b241de71d29d2e05d188ea8328854d8ea01d90c2ea463f78d"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlTypeUDF.getSqlType (cognitive 25): SqlTypeUDF.getSqlType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, loops 3, boolean chains 1 (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":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlTypeUDF.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fc2545b2b78893edcd6377477ab5294ff24d5c1132e2378e0bd48b730e5e80"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkJoinSelectForMultiTenant (cognitive 25): WallVisitorUtils.checkJoinSelectForMultiTenant has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5506c23c049a013a174c2eaa4146574dd56313ab3e98c4fa1f3db6d8e5ea640"}},{"ruleId":"D2","level":"warning","message":{"text":"StatFilter.buildSlowParameters (cognitive 24): StatFilter.buildSlowParameters has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, 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":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"090cf2a00f525984acbb1700b4a546714377d9f8a29a73bddb306a1dcd500845"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedStatementProxyImpl.setObjectParameter (cognitive 24): PreparedStatementProxyImpl.setObjectParameter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/PreparedStatementProxyImpl.java"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2004e1e06eb4123e9cc62429dd03bf1cc57e777069e67e7e4776beb36ac2b34"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.findSelectItemAndComputeDataType (cognitive 24): SQLSelectQueryBlock.findSelectItemAndComputeDataType has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"baec0958bf23c2c25a04409fc6e5885d7bd0eeda27f483b50959d953f5c8621a"}},{"ruleId":"D2","level":"warning","message":{"text":"BigQueryCreateTableParser.parseCreateTableRest (cognitive 24): BigQueryCreateTableParser.parseCreateTableRest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryCreateTableParser.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad7b6a4d4f2c017a815c51e69424c4053ee38303e7bb7cf6019d055878dbfa"}},{"ruleId":"D2","level":"warning","message":{"text":"ImpalaOutputVisitor.visit (cognitive 24): ImpalaOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 14, if/else 10 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/visitor/ImpalaOutputVisitor.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"80851b6e10a8ace591c4113c3ba8efd3d42ff214b6d980152ae36b193ced8476"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateEvent (cognitive 24): MySqlStatementParser.parseCreateEvent has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65ef4315317ca243fb3a3f74fdb52e751e095285256c63e9c3eed45cbd73cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 24): MySqlOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 15, if/else 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41ab59ee98ba16538215ca4fd5063dda4f5d56159ef205a921f302bbf065c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parseSet (cognitive 24): OdpsStatementParser.parseSet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ddb602acf20ca2a342ad9896a0287436cf9cf844ec26aefeff0bd54eb5a38f"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleLexer.scanNumber (cognitive 24): OracleLexer.scanNumber has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, boolean chains 8, loops 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e34311c209ecd41e27a2d807ce7c8c8fc9fc1090df1f0b44de296e0dc79e8bd"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 24): OracleOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, ternaries 11, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad3daa918c0ba2e896e3c2c124925d309aebe73f7f2e2ec92dcd49868c474b0"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 24): OscarOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 15, if/else 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee93495e78d2ae98fd7bf232b22a6d75dc8559d20a6cacc5cc2df8e4cb2c938"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 24): OscarOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, ternaries 8 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"231ed95e406a146126b83ac44e57db73ca365cb280167854e700eba7b82854e5"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarStatementParser.parseSet (cognitive 24): OscarStatementParser.parseSet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 5, boolean chains 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6476364d731a3e3274b029e886b7af48a9de8d04f0f4684ae197b03a6691a571"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 24): PGOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 15, if/else 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ed7471bf4314da68d669117d57a8be77eaa03fd316a002abebb5308b885f35"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 24): PGOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, ternaries 8 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"831a7e69f78270d864674d01e6821878931fda24e18b0c683b4170c21464eab9"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeStatementParser.parseAlterTaskRest (cognitive 24): SnowflakeStatementParser.parseAlterTaskRest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, loops 7, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"843107c41e987ef1c2f1ce78229208a67e5d07f6c50b03c634f568745c7bbbfc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cognitive 24): SQLServerOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, ternaries 11, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06b1e111f2d8d993cc9889ce68971149726f4bff7341dbeb13b31efc26a5ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLParser.printError (cognitive 24): SQLParser.printError has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, boolean chains 3, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4bc1b3f23e01b3b494a0d1d155c41469f5f257a7fd71a1549d389ba22049a8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseDescribe (cognitive 24): SQLStatementParser.parseDescribe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0409ff3ec693ba9fd9eea627bb8b7293c72c0710cb925477b4c7b945fa7bcca"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseRevoke (cognitive 24): SQLStatementParser.parseRevoke has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, boolean chains 2, loops 2, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"1108a01a22d6c52d1127ca93174d7a68078141cb300d3693ce0c822bb001caf3"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.hiveVisit (cognitive 24): SQLASTOutputVisitor.hiveVisit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 16, if/else 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9956}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2b5fe5dd701fc644251f68b44a48bc27dba2bb1ad6d660037ade310d2f1b11"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 24): SQLASTOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 16, if/else 7, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8031}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb92797b8c91dac2e3b5bcb7736ed9497af486f55f059cc7f959cdce235ac54"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 24): SQLASTOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 15, if/else 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5879}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3701b697d89f4acd3f7e5e3411ebb772103d7b1c7ceb99fe3374e3700d9f07"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 24): SQLASTOutputVisitor.visit has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 16, if/else 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11062}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4beb235c5573a137a16787ea2534d9ac9b408d82765bade53abd30e739d25ed"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.lt (cognitive 24): SQLEvalVisitorUtils.lt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, boolean chains 8 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3fec4a82629db4d756e6bc715ac2d11ae56bb44183316c20caa2e3d9beb660"}},{"ruleId":"D2","level":"warning","message":{"text":"StatViewFilter.init (cognitive 24): StatViewFilter.init has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, boolean chains 5, loops 4, error handling 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":"core/src/main/java/com/alibaba/druid/support/http/StatViewFilter.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"184bd799c31fc4a06f3f041d8d63f57dbb8805477210ffcc34ccd7d90f427cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"IbatisUtils.set (cognitive 24): IbatisUtils.set has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, boolean chains 4, error handling 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/ibatis/IbatisUtils.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"809d06fa96f23687a0c234131cac30fc75241b7644c07dd014f7ae5bfa5b4690"}},{"ruleId":"D2","level":"warning","message":{"text":"StatViewFilter.init (cognitive 24): StatViewFilter.init has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, boolean chains 5, loops 4, error handling 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":"core/src/main/java/com/alibaba/druid/support/jakarta/StatViewFilter.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab0863bf20bcc8882244fcedebcb0a9ed130d32a32bdf79848774ff11e50baa"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.isSimpleCountTableSource (cognitive 24): WallVisitorUtils.isSimpleCountTableSource has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"938e7bc3981bffed6405336b6a109ebb0e922015c7d660c5833ae937a7dde445"}},{"ruleId":"D2","level":"warning","message":{"text":"LogFilter.resultSet_next (cognitive 23): LogFilter.resultSet_next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, error handling 3, loops 3, 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":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe1aa4f757f615e29a8a91c52f85021e084260b0f189446c7f788a9c92f2817"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidAbstractDataSource.testConnectionInternal (cognitive 23): DruidAbstractDataSource.testConnectionInternal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f1f25062ee4828fab87b89c06fb2b96ef3d22783973495bd89c79ce4b2102f"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.removeAbandoned (cognitive 23): DruidDataSource.removeAbandoned has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, loops 11 (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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":2932}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d4adc23cd0d8522bd4199079250e590a56fc738ef1cb38c1e693353ad6c042"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.acceptChild (cognitive 23): SQLSelectQueryBlock.acceptChild has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, loops 7 (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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8b0e5f036b1c2c918ff2247c50256bb8dd4c53fad8121bc16b891f30e825cf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.getMappJoinTableSources (cognitive 23): SQLSelectQueryBlock.getMappJoinTableSources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 6 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad4245d170106efbfb8078f233c45d4bf76307579977fb8314154e8bd91779"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLIndexDefinition.getOption (cognitive 23): SQLIndexDefinition.getOption has cognitive complexity 23 (threshold 15). Drivers by points: if/else 21, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexDefinition.java"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"16db5a6615f187642478aaa06dca53ce9e1f80db137d5dc674de55f14239c707"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2OutputVisitor.visit (cognitive 23): DB2OutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, ternaries 11 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/visitor/DB2OutputVisitor.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e584f2a06fe22a1af5680e8078ad2576a1f13205d1d2d262c4de7084acf597e8"}},{"ruleId":"D2","level":"warning","message":{"text":"H2OutputVisitor.visit (cognitive 23): H2OutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 5, ternaries 5 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db07a4ee963841ee5d47f7e943525f97c3e07a675a32e27bf65bced8ae8dfd5"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.createTableRest (cognitive 23): MySqlStatementParser.createTableRest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 21, boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"91808f6cb3f1b58c421aad9b66459b4cc2d3dd5568e06f6a35028923ba60574b"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseDeclareHandler (cognitive 23): MySqlStatementParser.parseDeclareHandler has cognitive complexity 23 (threshold 15). Drivers by points: if/else 22, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":9014}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6073bdd5df5b570d36a2a478de698ccd4a78d99e636b10bf3baa3ba484e6a37"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderByResolve.visit (cognitive 23): OrderByResolve.visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/transform/OrderByResolve.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee18ff50aeab9f01993e5e1936ac60cb3f36b1e784da013bcf2ccde53f42eb76"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 23): MySqlOutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 16, if/else 7 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d04a5b3e61959d66fb645fc1dc81bcbb02ac604b10989a322829e0bc6232e00"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 23): MySqlOutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 16, if/else 7 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4973}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec88cea33f2ab16023ca4860d755ea662bbe591867bd7ef408a75fa2362a850"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleUpdateStatement.equals (cognitive 23): OracleUpdateStatement.equals has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 13, if/else 9, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleUpdateStatement.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7ef258fb96fb5dcd5beb86e40c22442bdd3d99f9feb8833edce993faeb0433"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseCreateIndex (cognitive 23): PGSQLStatementParser.parseCreateIndex has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"229f68bd86600f0038e20e1479c78a3b85d83c92a3c1006d1ef307c4daa693cb"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksOutputVisitor.printUniqueKey (cognitive 23): StarRocksOutputVisitor.printUniqueKey has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 17, if/else 6 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"04936aa30db689a81a27a4473b08d2e01355162e00c21adbd61092c78a8f2201"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanString (cognitive 23): Lexer.scanString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 22, 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e4fa9cd1bf084f374454ad03f1b151e618e236f30d741aae993d915f472551"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseLimit (cognitive 23): SQLExprParser.parseLimit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":6340}}}],"partialFingerprints":{"codehealthFindingId/v1":"020a5c0d077d5607977d6f423773e2ff501ad8cd14bb930107214ae9547ae3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseHierachical (cognitive 23): SQLSelectParser.parseHierachical has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"456b62c37df2aea476ceef6a261d8f598ccc4c6da9c7027946f70d3e628648df"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.select (cognitive 23): SQLSelectParser.select has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f631bc05913d0636aaf630f657476e3d56783b023fb0d6f7c76c63f95e9167c5"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseCreateDatabase (cognitive 23): SQLStatementParser.parseCreateDatabase has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75126a246d903f97dd2033dd6934bfe105d648dd5fd1857b1968176f3e6466b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseHiveCreateFunction (cognitive 23): SQLStatementParser.parseHiveCreateFunction has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7701}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f46800cfd824b74b56914d210238fee4a3f0b9fbda55b5c7d6501dac0c770"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseMergeWhen (cognitive 23): SQLStatementParser.parseMergeWhen has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5709}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be98360fec0ba262eb792fbdbbee35a7cfae4a808881cc74b50b1b9a6f22a92"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.findTable (cognitive 23): Schema.findTable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 23 (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":"core/src/main/java/com/alibaba/druid/sql/repository/Schema.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af8dff2049be32f7fb81ce7907efdc3c842ee891385ab00c5600e2be8349c26"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 23): SQLASTOutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, ternaries 11, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7319}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b47d951be1aff194fb76efc1cc46906f3b3d9e8f6a031e3ab412123c3c1523"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 23): SQLASTOutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 17, if/else 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d681a1eb14a042c8aaec47a87d7805298b7117f0d18539fc6efdc0761020e28e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 23): SQLASTOutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 14, if/else 8, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cce5728b09ba4087e08f55dbe98cf2b5eb76f64820113685720539161fdbfbe"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 23): SQLASTOutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, ternaries 6, loops 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e24c41994a911f0c29132b140cbd74ec20a81dec10fee35f59a9e469da33803"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 23): SQLASTOutputVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, ternaries 9, loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca3639519a99e764be1799de19eb2a1fd41b1e564e954f329e56c9877467d43"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.multi (cognitive 23): SQLEvalVisitorUtils.multi has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 10 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"591d1e536a9b24b31095dbc32c92f95ce673d6b0261bb83d6bd2deaf4286cde2"}},{"ruleId":"D2","level":"warning","message":{"text":"CalciteMySqlNodeVisitor.visit (cognitive 23): CalciteMySqlNodeVisitor.visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2a8cacc4a775878212c7c7b60ab44bc890cf2bd0dd358c44996b434bc343cf"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractWebStatImpl.getSessionId (cognitive 23): AbstractWebStatImpl.getSessionId has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, loops 7 (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":"core/src/main/java/com/alibaba/druid/support/http/AbstractWebStatImpl.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba9cd09c9a393195e7150db752e03a491d269cbfaa2e4d3bee3b25c3300bede"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractWebStatImpl.getSessionId (cognitive 23): AbstractWebStatImpl.getSessionId has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, loops 7 (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":"core/src/main/java/com/alibaba/druid/support/jakarta/AbstractWebStatImpl.java"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"375bbb3159b4896dfa91ead6a2fbb9f922815f472aa2f556448a371ca8f050cd"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExceptionSorter.isExceptionFatal (cognitive 22): MySqlExceptionSorter.isExceptionFatal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, boolean chains 7, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/vendor/MySqlExceptionSorter.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abbd4efc9a7193c5d530ca8dbd04da4db152d548b7908f161d68297c2803074"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.handleFatalError (cognitive 22): DruidDataSource.handleFatalError has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 5, loops 3, ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fc6bc5f133d748442c583d5cb882fbd28cfddb67f25a109c692761a88a32a4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.hashCode (cognitive 22): SQLSelectQueryBlock.hashCode has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 22. 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"889705f8a3cd553c451193fd2d47a2d241476dbfd05536a4ed05132cec24742b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImpalaOutputVisitor.visit (cognitive 22): ImpalaOutputVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, ternaries 8 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/visitor/ImpalaOutputVisitor.java"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a6739ad757fa1aaadd799b5ca1f28d479b350ff3588b32050031637a1812e9"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.\u003Cinit\u003E (cognitive 22): MySqlExprParser.\u003Cinit\u003E has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 7 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66a6977fb95758c6e3bc7afd717aa80678d74c1d44c77dd4b7db63a14eb4bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseAlterTableAddColumn (cognitive 22): MySqlStatementParser.parseAlterTableAddColumn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3b721f8b38bd632f73b28ac93868d01a0214928be2e1cc9970055f0f95fe2d"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 22): OracleOutputVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 13, if/else 9 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd988eece0f73a962ca612eac32b27d8d20496bbc2b2b4e2bdbc5089c6348982"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.alterDatabase (cognitive 22): PGSQLStatementParser.alterDatabase has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4daf929c5bf57bd4003fb8e0175999fffb6058ff5214293a1649d813285a3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseBlock (cognitive 22): PGSQLStatementParser.parseBlock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a1cddd954298cac2f42a92fb412e071d08e4d8c783100685c19ae0738865f0"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseCopy (cognitive 22): PGSQLStatementParser.parseCopy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf6372a4e1f34b3b9af759a26b2f886f9a054caf50cc1e7172a446d7fcc31b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 22): PGOutputVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, ternaries 11 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36b10db72044da0e2d48ca343fc4c304f2ae8ee203b41bee18ec0e97e9b27e1"}},{"ruleId":"D2","level":"warning","message":{"text":"PrestoStatementParser.parseAlterFunction (cognitive 22): PrestoStatementParser.parseAlterFunction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea6f646c0c57275c479552ebd8a6dc475b7d24d03a23d7d2031539264572921"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerStatementParser.parseInsert0 (cognitive 22): SQLServerStatementParser.parseInsert0 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2436595f80a4a38e6090b3dcc0cae07354fc3bcd470f3a2f6702decd2a73df"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseSortBy (cognitive 22): SQLSelectParser.parseSortBy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb4745ad8a4da3d330aaa1f2ef60f05afe83de080e724b1bb242a932c9028ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 22): SchemaResolveVisitorFactory.resolve has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a60ea6d3540d7af0ef8ef3daeba0f9946c6c06c73388d816780454e536ab26d"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolveUnion (cognitive 22): SchemaResolveVisitorFactory.resolveUnion has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, loops 7, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d1c1a845535fc83083e66dd0e29c54459d3f643a234d73aa87d626a2d5474c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 22): SQLASTOutputVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 11, if/else 10, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7403}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed89c98f6d1d0a37cf1a730b21e18f09fc7c1677d92fab143b060fda2e4e24f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 22): SQLASTOutputVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 13, if/else 9 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6652}}}],"partialFingerprints":{"codehealthFindingId/v1":"575c3dae576679511314687e1076f1983c7ebd6289cbda1623d35874997b411b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 22): SQLASTOutputVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9, ternaries 9, boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeeba77b0b4f90ec985c049d1726dfe87730c1c6726ecbb789b8d57f27ef9cd"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 22): SQLASTOutputVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 13, if/else 7, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b9730bd96dc9de37b03e2f70721c662ccc1914638b0b5d7f61f570dc60d81c"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.visit (cognitive 22): SchemaStatVisitor.visit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, loops 4, match/switch 3, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf64a67aa952d4c081a5acbfd21dd2a7866cb6e15b3f3cc57e3b08904b3ba0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"FileNodeListener.refresh (cognitive 21): FileNodeListener.refresh has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/ha/node/FileNodeListener.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"74373f12f822d35c4b9966831d9c54312c02261327b4b4db2ae08a249ef1d5de"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLAggregateExpr.equals (cognitive 21): SQLAggregateExpr.equals has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 10, if/else 9, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5a1d778a7fec7ce5d63817f82deefda4a0864063fc232d8e361d992770e96e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLCaseStatement.accept0 (cognitive 21): SQLCaseStatement.accept0 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, loops 6 (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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLCaseStatement.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dc5662deac34e83f51cd1e848f8318161bd5b56f6f7f7716644eafe028f8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLJoinTableSource.equals (cognitive 21): SQLJoinTableSource.equals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, ternaries 9, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLJoinTableSource.java"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"3807c0d31eb6995570083902e368f0049e988ce8af12abf3e4528a8e9422e241"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLUnique.applyColumnRename (cognitive 21): SQLUnique.applyColumnRename has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnique.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19cfca51039d15abb460bbb4a5fb5cf5530ed428ddb8e39700aaded72f6b8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussDbCreateTableParser.parsePartitionBy (cognitive 21): GaussDbCreateTableParser.parsePartitionBy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0664c74254d1c32042a5938a3b193c7272c4ec4bb2bfc4e8e720e07c6a574532"}},{"ruleId":"D2","level":"warning","message":{"text":"H2OutputVisitor.printTableElements (cognitive 21): H2OutputVisitor.printTableElements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"adafd613d2ba4426d1da51a4345016f4b157727511558805784affbe4278f2e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ImpalaCreateTableParser.parsePartitionBy (cognitive 21): ImpalaCreateTableParser.parsePartitionBy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5b5ea4f32df3428e0e827fdb7872edcbc859cb745e6ff649d6ff61725a222a"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlTableIndex.applyColumnRename (cognitive 21): MySqlTableIndex.applyColumnRename has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlTableIndex.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"04482771a2cc713d43d0c1a85706afe6d8eb2c0d71a571a8f9f533e8f024429f"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.alterEvent (cognitive 21): MySqlStatementParser.alterEvent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5665}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6353962ed511a619816d50f6875b46c0b033cfa50b27047047f311374790f7"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.printInsertColumns (cognitive 21): MySqlOutputVisitor.printInsertColumns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ef48f17827884471c5eea7e7d7050664cca2b1eec169a037a9d65d0d35f869"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 21): OdpsOutputVisitor.visit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4572656ca9efe206cd0ba59980491613c2475275ff5b63f05adc65a0c38e42e8"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleIntervalExpr.equals (cognitive 21): OracleIntervalExpr.equals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/expr/OracleIntervalExpr.java"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75acf74690eacb6850b9168bcc0db559850133b5168ef9eddc01b47dd6350bf"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseCreateProcedure (cognitive 21): OracleStatementParser.parseCreateProcedure has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"322c2379412e7807e15461482d0631f4c17dc817b96f1eae369b3be6f91cc16c"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 21): OracleOutputVisitor.visit has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 11, if/else 10 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"535f0766acc08bf2a19c8e5fd9daa7bd6c0dbb12e7ebda5f781e4ee45b2db595"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 21): OscarOutputVisitor.visit has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 11, if/else 8, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"526241dd5280773ebfc519174beb8612b93b53cdcc9a50cab9acabcd749c875e"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeExprParser.parseColumnRest (cognitive 21): SnowflakeExprParser.parseColumnRest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeExprParser.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ecfb791c91d592a6c2a2e6a39c49714a8f7e729cdf7cd6bde72b05c0ebe073"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksCreateTableParser.parseIndex (cognitive 21): StarRocksCreateTableParser.parseIndex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31079d0b2541453ad603f890a13f00ae5400291c5632eff481eca473d6ea28d"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksCreateTableParser.parsePartitionBy (cognitive 21): StarRocksCreateTableParser.parsePartitionBy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02b1a17c3af78e191965d87df0071a852ad04ac9b1e5d6eea0ad1cf26e09f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"SynapseCreateTableParser.parseSynapseWithOptions (cognitive 21): SynapseCreateTableParser.parseSynapseWithOptions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, loops 5 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/synapse/parser/SynapseCreateTableParser.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2604ac2a6c1ce8659e73232d97bbebe61b5b1861ed109027fdb8332cefc462"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.alterTableChange (cognitive 21): SQLStatementParser.alterTableChange has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":2783}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bce1669dc0d4545428393c90bededffb3c6daa6b9f4e1e83cee5b600235c6e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 21): SQLASTOutputVisitor.visit has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 12, if/else 9 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62a9723f3df2f0de6599e3c727a8cc42ec1b0cbaee595e998d1784b76bd262f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 21): SQLASTOutputVisitor.visit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef16972a09f0d5abd5bf1b3b9cead636f2e891ddbfe72ed70817cfe7b1f849f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 21): SQLASTOutputVisitor.visit has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 10, if/else 9, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4974}}}],"partialFingerprints":{"codehealthFindingId/v1":"083b51d7d25262179a9f25b13852ab4fe085f0f6212659ed42051f46674eebe4"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.setColumn (cognitive 21): SchemaStatVisitor.setColumn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36602dc179d851814f582fe48b155cbd1119159af6adf96162d2d9b308003be"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.statAllColumn (cognitive 21): SchemaStatVisitor.statAllColumn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c097b9bd54044d2776a14e96a8fdc250db88c7bcfc3cc0a0ccd6f5fc5661ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceServlet.initAuthEnv (cognitive 21): ResourceServlet.initAuthEnv has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 4, error handling 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":"core/src/main/java/com/alibaba/druid/support/http/ResourceServlet.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9396659c1c8d768378bb4481eff2354059939f1e8624bb6e4b660074fa8f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceHandler.service (cognitive 21): ResourceHandler.service has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/ResourceServlet.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3873fee1b58150f017e27f31f1ceb4d19e3bb410d80b0dceba55b8cfe9079f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceServlet.initAuthEnv (cognitive 21): ResourceServlet.initAuthEnv has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 4, error handling 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":"core/src/main/java/com/alibaba/druid/support/jakarta/ResourceServlet.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b664c7077295f5f0920c3e07f31d56e40982e506ad5e34446c272c5e8e4be7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceHandler.service (cognitive 21): ResourceHandler.service has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/jakarta/ResourceServlet.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3581d0632504ef496f2042b558bd1fed456ec1b750a811422bc8cb936408c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidStatInterceptor.getMethodInfo (cognitive 21): DruidStatInterceptor.getMethodInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 2, boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/spring/stat/DruidStatInterceptor.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc270f3d0585361077e84a2751fa531336ede490685a952e624fd423eddb8809"}},{"ruleId":"D2","level":"warning","message":{"text":"LogFilter.logParameter (cognitive 20): LogFilter.logParameter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 4, match/switch 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":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c37219bde2ff3a44a28a90c84b5287d77cd398a1fd892a8b6a87156bed91f28"}},{"ruleId":"D2","level":"warning","message":{"text":"StatFilter.internalAfterStatementExecute (cognitive 20): StatFilter.internalAfterStatementExecute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, match/switch 4, error handling 3, loops 3, 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":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"6351f50ca1b9bd80b28706208bcdc7f6265fecba5c535d054a870db6d7a8ab1f"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.pollLast (cognitive 20): DruidDataSource.pollLast has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 1, error handling 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba6d9c04405fa3cf8140f5d28efeeaaa2d2dff41a801fcf97f345f32774a3e7"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.setConnectProperties (cognitive 20): DruidDataSource.setConnectProperties has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 4, 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba35624f4f569e82d74342dd5d2f43561faab44b888ef068b0ec34bb2e96540"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidPooledConnection.closePoolableStatement (cognitive 20): DruidPooledConnection.closePoolableStatement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, error handling 7, 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b904340d65ed0116eb4dc51f8abeda36b08d9528eebdb1c3e30a124a66143c57"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBinaryOpExpr.replace (cognitive 20): SQLBinaryOpExpr.replace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e77dcabc438be52190e0da882a99feaf7bb77aa8cbb24d6465ff7a64aeaaae3"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLCreateTableStatement.cloneTo (cognitive 20): SQLCreateTableStatement.cloneTo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4273bc1cda7f66aa01c2bd04808cb7090fe896624698bfd7b8c47e757b4d0027"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLJoinTableSource.rearrangement (cognitive 20): SQLJoinTableSource.rearrangement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 4 (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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLJoinTableSource.java"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"632d88f7de584072f307a3dd950abb032262c1494001e01efdaf3e0c9d5aaaa7"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelect.accept0 (cognitive 20): SQLSelect.accept0 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelect.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"82926324edaea0c3d102af14609b23afc55d016672cf317176fa2016fbcc9d51"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLUpdateStatement.equals (cognitive 20): SQLUpdateStatement.equals has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 11, if/else 8, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acc692017fc7c38fe91b77199f457816f1146b25f207e7d77987bc42eaa7df9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLOver.accept0 (cognitive 20): SQLOver.accept0 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLOver.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ee253deabd193cd65d0c5c38aab2f84b22c83ea8df5b62e23a169afa56afc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLOver.equals (cognitive 20): SQLOver.equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, ternaries 8, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLOver.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0446a6a93e489975dec40996b97e2ab6a6529c54bba48e5f962e0329b2d72834"}},{"ruleId":"D2","level":"warning","message":{"text":"CKOutputVisitor.visit (cognitive 20): CKOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, ternaries 8, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"916e9a166c952bf2ea5634182f383098c72ee4d83ee139d2b1e36a8057e9b874"}},{"ruleId":"D2","level":"warning","message":{"text":"DmLexer.scanString (cognitive 20): DmLexer.scanString has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmLexer.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5967a3535679c94f6d5bc90d637f9f450a1226482d52e24a7633837f4c51f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveExprParser.parseAliasExpr (cognitive 20): HiveExprParser.parseAliasExpr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"48acf2615e2597c4b80d00fb81856e1d751a9ae2d0c47fe82327797d03f70dda"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableParser.parseTableOptionCharsetOrCollate (cognitive 20): MySqlCreateTableParser.parseTableOptionCharsetOrCollate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"379327b8a1d69247eb6f43889b8d84ed3e9145cf3bc45d1bc22262dc228a89e3"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.alterUser (cognitive 20): MySqlStatementParser.alterUser has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af208206f96044690c8cbd69b43b3c37c77d7a27c4094a799c70ff2115a0206"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateFullTextStatement (cognitive 20): MySqlStatementParser.parseCreateFullTextStatement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccf1e50f908bfa22df1b183251b4eb08b1b701696b4724468aaaddb0b23c917"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 20): MySqlOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 4, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafbf52fd766731e170720aeff0bfd5b61c01bc53c4d15cc1e27168cd0b15336"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 20): MySqlOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12, if/else 7, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"de88e277d8c503bdc64d6fcf060973bcdd3d1a15e792baae8447fa82d955fa8c"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 20): MySqlOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 13, if/else 5, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d563cabf7ae17b2c456bfe0a3be6325d8ab616951c1cbb775d69526b7ec446c4"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parseColumnRest (cognitive 20): OracleExprParser.parseColumnRest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef81648179de2f17f15cefddeac6224b93e7a35d3ee7cc4efdc9bbfc0fada0"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectParser.parseTableSourceQueryTableExpr (cognitive 20): OracleSelectParser.parseTableSourceQueryTableExpr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33e435b903d4b4acdb1c52e32cc097205d31e787b1bcd3c9f649092800c9bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectParser.parseWith (cognitive 20): OracleSelectParser.parseWith has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4687ff4196c47292262f6064731eee5f4025f945194996f108b1df89a05d3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseCreateSequence (cognitive 20): OracleStatementParser.parseCreateSequence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"739c1574c8b3443a894fe4c1e848f65d36ad0fc4766f147a5a5ed4e9a2e6f7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 20): OracleOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12, if/else 8 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c11f9ae8538f53e30c830bb1556651ecafa3c2a6939b0476090f0b7b5ab1a66"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarExprParser.primary (cognitive 20): OscarExprParser.primary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0244b31d8fe3ee4504d835ad3fec9d29d64941bf88ab5d6f52845de852ea9d82"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarStatementParser.parseCreateIndex (cognitive 20): OscarStatementParser.parseCreateIndex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f98aa5ff694f16edf3a0233d18bf3653ec5d2f7e4ba8b0af299eabf8ebe2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 20): PGOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 11, if/else 9 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"713076f44a934ef7bfb811dc1522b664b703bcc5dc23ce19a0cbf24d7af01138"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerStatementParser.parseCreateProcedure (cognitive 20): SQLServerStatementParser.parseCreateProcedure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0982bf0defecf4c3e65a510c30cc63f62a99a8ce0d503088937c42f7dc3c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.computeTables (cognitive 20): Schema.computeTables has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"core/src/main/java/com/alibaba/druid/sql/repository/Schema.java"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e8217ac1a405a2a5d6201442722f15097f9a246abef1336cf28676de2fd055"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 20): SchemaResolveVisitorFactory.resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"509668610cb2459a1f4742783d3054f7bf3251f409dc15d5bb1492d1a7b56728"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 20): SQLASTOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 11, if/else 8, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10067}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a5f4caff0c256468d0bd8cf4c740de43c80f7e463777beeebe1db9403a4db4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 20): SQLASTOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9, if/else 8, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"457b74e90c9a203a1c6d2c158c87a2a211f07da043bc68d927af6278fba3dac5"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 20): SQLASTOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, ternaries 3, boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a27753497823d9f1404397d83eb097509ff9f2a23b724eb982c005081db48a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 20): SQLASTOutputVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10, if/else 8, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8531eca6fbf3cf87b16fe591a9b87a68c4d02577394e30db33cd96c623065f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitorBinaryOpSupport.visitBetweenExpr (cognitive 20): SQLASTOutputVisitorBinaryOpSupport.visitBetweenExpr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, ternaries 8 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitorBinaryOpSupport.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06a1c15ee0b658af11913ae63f6429bb1e6737935af62131db821ff209deebf"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.visit (cognitive 20): SchemaStatVisitor.visit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, loops 7, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":3097}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afae25db4c21800567a2ba8ff80037787f4e76c588ae62f948b97288a739288"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidStatManagerFacade.getSqlStatDataList (cognitive 20): DruidStatManagerFacade.getSqlStatDataList has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, loops 3, 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":"core/src/main/java/com/alibaba/druid/stat/DruidStatManagerFacade.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aed8a838b9258807994494a1ae1d7358b0f0e543dcfd6ba72eee8641ef766a"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSourceUtils.configFromProperties (cognitive 20): DruidDataSourceUtils.configFromProperties has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, boolean chains 6, error handling 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/DruidDataSourceUtils.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5eeda6b06f06b728f5bb9a0ceadfb78344e9f72880d8644b580a0c63ed1c73"}},{"ruleId":"D2","level":"warning","message":{"text":"ServletPathMatcher.matches (cognitive 20): ServletPathMatcher.matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/ServletPathMatcher.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d431caf2b77a4a6f933f3d65960773f0df3827d1f76409d906b5bf2c69d62b"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkUpdateForMultiTenant (cognitive 20): WallVisitorUtils.checkUpdateForMultiTenant has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"34964d8e43a9f4959880d9c4aad4c5aa1680a26b5efabf4ee03a4a62043462b0"}},{"ruleId":"D2","level":"warning","message":{"text":"WallFilter.initWallProviderInternal (cognitive 20): WallFilter.initWallProviderInternal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"core/src/main/java/com/alibaba/druid/wall/WallFilter.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2835bf4938930d5bf411764e46d51e936f74072703c7cc1759c14416e1e6faf"}},{"ruleId":"D2","level":"warning","message":{"text":"MonitorStatService.service (cognitive 20): MonitorStatService.service has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 4, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"druid-admin/src/main/java/com/alibaba/druid/admin/service/MonitorStatService.java"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"398ae47f89d21a57d946f21a658b33b76218df2d0a84cfab906c34b0966dce30"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPartitionOf.accept0 (cognitive 19): SQLPartitionOf.accept0 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19 (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":"core/src/main/java/com/alibaba/druid/sql/ast/SQLPartitionOf.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"46733ed210fe2a2505b534d1c9ed61fb09661649727e259326cb5984d17fd311"}},{"ruleId":"D2","level":"warning","message":{"text":"BigQueryExprParser.parseDataTypeStruct0 (cognitive 19): BigQueryExprParser.parseDataTypeStruct0 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, ternaries 3, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryExprParser.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c3ae53e3889f0d6b73357795485aeea0062ab2f4464331d63acd22bf688afd"}},{"ruleId":"D2","level":"warning","message":{"text":"DmExprParser.primaryRest (cognitive 19): DmExprParser.primaryRest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"89105ffa13d53b52044559fc508747cbfd93513d7d7487f5899c4ae2a1a56f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveCreateTableParser.createTableBody (cognitive 19): HiveCreateTableParser.createTableBody has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69e423302b4f205d11da413654b39546f0396aa5f6d28076de18170400528af"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableStatement.accept0 (cognitive 19): MySqlCreateTableStatement.accept0 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b6cf2f114ed149e9439523223a5c3587cc3566cc3b8636e4fa06ec5a856a85"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCopy (cognitive 19): MySqlStatementParser.parseCopy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 4 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":9166}}}],"partialFingerprints":{"codehealthFindingId/v1":"192c7def06884a6dacd6f4187a018fc18af35901300ee0bc46fab247e37bcc95"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateProcedure (cognitive 19): MySqlStatementParser.parseCreateProcedure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aa0e868d70ba94b1300152a5b38fd48962bc225468dae114ccc1182aafed88"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 19): MySqlOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, ternaries 9, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0537d250e314d95272f9d68630f518f267010c87fd25bd923b9bed8a12b5021"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarCreateTableParser.parsePartitionBy (cognitive 19): OscarCreateTableParser.parsePartitionBy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarCreateTableParser.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3aafcb1f3e10316b35bece4389d2baefe4caf06e23cbfc96e47da68fe0cc94"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 19): OscarOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"559f6cbc75c408cccc33dca905aa6f85caac8ba12183815a8e6448c339a0659c"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseCreateSchema (cognitive 19): PGSQLStatementParser.parseCreateSchema has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc17b1abf8f200dfae4a3d986f5b6c1287c59c401f8b3978ddea594bdd4d4b58"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 19): PGOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8c782770d1d4397e804c3b76834c93a99c37cf9f191593297d4caadae9c4d3"}},{"ruleId":"D2","level":"warning","message":{"text":"PrestoSelectParser.parseFetchClause (cognitive 19): PrestoSelectParser.parseFetchClause has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoSelectParser.java"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3977caa801793f36ae8b7922cd34b9ef4c0e76abe7399c3580b6c1699df904c8"}},{"ruleId":"D2","level":"warning","message":{"text":"PrestoSelectParser.query (cognitive 19): PrestoSelectParser.query has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoSelectParser.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"20af71a6ba5ec44682bb17c1a3df280d92fded4580fe1bc5b8e731b886f5e206"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeStatementParser.parseStageOptions (cognitive 19): SnowflakeStatementParser.parseStageOptions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32d872855fbe038f4603bfa14dc21f038669bc499736fa02cfda6c69ee92707"}},{"ruleId":"D2","level":"warning","message":{"text":"SuperSqlCreateTableParser.parseCreateTableRest (cognitive 19): SuperSqlCreateTableParser.parseCreateTableRest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/supersql/parser/SuperSqlCreateTableParser.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e280b92c0be930695c62a51dd3878f98d733718167417b89f395d2d055ed9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.decimalValue (cognitive 19): Lexer.decimalValue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 3, ternaries 3, 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5ca1fecc709623d49025b4bcad6c55a74de008db27c79a752eb70b5ffb4bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.integerValue (cognitive 19): Lexer.integerValue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb54f292b3c64dc5a372b179129ac099e444a7710a74b9324776d5456877e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.name (cognitive 19): SQLExprParser.name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 5 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fab962e9feaa9059fd7608332f03239aaa48a0dc46aeba665f25c129b717afa"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseReferenceOption (cognitive 19): SQLExprParser.parseReferenceOption has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9e1f0a36302c3429bbf0dc0038128bc54266d46a27e3a52bf69b714d072586"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.primarySub (cognitive 19): SQLExprParser.primarySub has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 2, boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad57011d7017ea94338f6ba9603d8951dea8335bde89097f8a4735d5a1a3c6f7"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 19): SchemaResolveVisitorFactory.resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, loops 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54bdd61c302f1633abb90e6378a34197c0d2d51084801a35c64db9d20951d80"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printHierarchical (cognitive 19): SQLASTOutputVisitor.printHierarchical has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11, if/else 7, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9059}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d07f21c261947d120a2a18c7a66dbd6eeb432b5a0333c5ab6f624d847c3390c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 19): SQLASTOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 12, if/else 7 (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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eff68e37ed709f914682c6d866db088bad301fceab455b075c4951dfebcf3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 19): SQLASTOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13, if/else 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6429}}}],"partialFingerprints":{"codehealthFindingId/v1":"33143feea38e816112d4037dda628f4fca5fea39a778c1a51e091735013ba29b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 19): SQLASTOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, ternaries 6, boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af52a74a956b1160743c2e2dae5892afd2c0d3c24a684cb5f605c6c7e98f475"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 19): SQLASTOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 15, if/else 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11793}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7796e4c152cbea9cac0964d4ac223a774de0a31615e224620895f6c2c65c570"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 19): SQLASTOutputVisitor.visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, ternaries 6, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3874}}}],"partialFingerprints":{"codehealthFindingId/v1":"c935eb35a9af561de967e1622c2af0e478696096c1184a46ecd0c7ec6e4934ed"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.type (cognitive 19): SQLEvalVisitorUtils.type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, match/switch 4, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c564126da0733e9afcb1eea7ae6cd55fac6e2a0b7a194eed1f368e96ec3fb017"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.visit (cognitive 19): SQLEvalVisitorUtils.visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"c237398aa2a9e040e44591ad8800e4de3fd5f1d0b71b109e05a9f1426185ec9d"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaStatVisitor.handleName (cognitive 19): SchemaStatVisitor.handleName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"449cf5c6ca2cad0d4cf57d9a8a6a1b3cb02d3def8fa9191e35dd4e595ed181bc"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONParser.scanString (cognitive 19): JSONParser.scanString has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/support/json/JSONParser.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73f6839173f7d07c77926b58170ad08b25d8d209dfe2b9b917c7fd4ebbb0ced"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlTypeUDF.getSqlTypeForSingleLineSql (cognitive 19): SqlTypeUDF.getSqlTypeForSingleLineSql has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 3, loops 2, boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/opds/udf/SqlTypeUDF.java"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f05466b17554016dd8a67095d5f603b10c172bf3944696bde1a3c690017fb31"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidWebUtils.getRemoteAddr (cognitive 19): DruidWebUtils.getRemoteAddr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8 (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":"core/src/main/java/com/alibaba/druid/util/DruidWebUtils.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67743435b14525130e8c5c0ad8893970f983b46938fd201ba8106b6c5c8544e"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidWebUtils.getRemoteAddr (cognitive 19): DruidWebUtils.getRemoteAddr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8 (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":"core/src/main/java/com/alibaba/druid/util/DruidWebUtils.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8734cf2b0217a2b056eb5d1121caf8d8801a27a625439930c3b72f01dec325b5"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.getValue_and (cognitive 19): WallVisitorUtils.getValue_and has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fedcfa681f36b9ee2a9656d9232568148b862a41f9f7b32890f4999e73a647"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidAbstractDataSource.initSqls (cognitive 18): DruidAbstractDataSource.initSqls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 7, 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5399bdb66b8ea7403a2cb7c89872da2e0a88903f57569550b4622da1400ba7"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDriver.parseConfig (cognitive 18): DruidDriver.parseConfig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 5, 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":"core/src/main/java/com/alibaba/druid/proxy/DruidDriver.java"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec768fa88d23ee447333b8a549930e64d00612da540a437c0b7b4e2654ee3d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLDateTimeExpr.check (cognitive 18): SQLDateTimeExpr.check has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateTimeExpr.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e079ef113d78f24ab14b0f99409c9223cff63ca11568612d37baab91bfc433"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLMethodInvokeExpr.accept0 (cognitive 18): SQLMethodInvokeExpr.accept0 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcdee0bd112bdecbe270da1f1edd0e180268018d8ad4ad12bbc0e014dacfac8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLMethodInvokeExpr.accept0 (cognitive 18): SQLMethodInvokeExpr.accept0 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a822f2a3acef293c5cd0c4ea907adee11880ebd81e60a44e7fafef49c610fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLTimeExpr.check (cognitive 18): SQLTimeExpr.check has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimeExpr.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d91ae81d4678ff2dd978280d8593470aac695e152d16601dcab4f46d44b4ff"}},{"ruleId":"D2","level":"warning","message":{"text":"DorisOutputVisitor.printSqlSetQuantifier (cognitive 18): DorisOutputVisitor.printSqlSetQuantifier has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 14, if/else 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":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"043aecc71e25f2ac0f697e8f623a0005b206e98343f942d072b3d032ec6e4d40"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveExprParser.primary (cognitive 18): HiveExprParser.primary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0698fb45d9e42eec99aacae28f4bc5a7a717559efad29348a57d192d03544806"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSubPartitionByValue.isPartitionByColumn (cognitive 18): MySqlSubPartitionByValue.isPartitionByColumn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 6 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSubPartitionByValue.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3781df150aec29f71f5c9ed199f1e5db48fc55eb7ca220cb08c190db48b839a"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseRollback (cognitive 18): MySqlStatementParser.parseRollback has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d31d2dec5fc41d0fe245d11ade5b4699164d30672ff957c4e5e539fb6ca802b"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 18): MySqlOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 6, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"473b12d4a488b539c97cc185451d4f934e9f6300d8fe22b69d7910f005c9d6fc"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 18): MySqlOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 6, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4442f95e7c1fe2ae0a50f7533ce008a931ea9e67c8d21fb19b5599c4488907d"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 18): MySqlOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 8 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d85bfc673aee2161d56828721a17445758ac6f8a22f48d23fe5c7edc199257d"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 18): MySqlOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11, if/else 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ada4afc1dc16cf5bf3c42abc750c73d919c35b380237a6534fbb493aaefe794"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 18): MySqlOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, ternaries 6, loops 4 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2acebbdf01717cfbf5bf456427652cb1a3cf72be5052a0e400c7e0daa9a75cf"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.alterTableAfterNameRest (cognitive 18): OdpsStatementParser.alterTableAfterNameRest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"71908653bbfcc31ccb46ec4580afadfede916302fa9319da3b5dc49ded6bd439"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 18): OdpsOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 13, if/else 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"71083dd6f3a59222bc50085a0daf54ab08d9132693c01a8f3e3d2358be8b1fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectTableReference.equals (cognitive 18): OracleSelectTableReference.equals has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9, if/else 8, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleSelectTableReference.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0327a0f75d22748869b5d968fdf4bb9e5dafda2729c4028ebaabca6e59453390"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectParser.parseModelRulesClause (cognitive 18): OracleSelectParser.parseModelRulesClause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f6bda9369a33640c7a45d0872040b524578fa7305bc4afb53095bfed5dac2b"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 18): OracleOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f045939c8a5adf8b89d6cb5ddb708a65dae0795295d11235cce200f3efda0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 18): OscarOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dbb50cc78d3f03b378d5def4df117f4864c3dcb316136ea611368c4db8dfdc"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 18): OscarOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9c2f7f6bf85bf59a41842361dfdec35862515b1aaffbef825323ab5f54ddce"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseVacuumTable (cognitive 18): PGSQLStatementParser.parseVacuumTable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6805875bbfea448abea6c8fc584df5af3bb4cacebcc590eb5c7db76d1d0bf825"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 18): PGOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ec22b5bcd25ab975a7071d30301aaba39ef328bf2d9ef4af8a8475955f08ae"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 18): PGOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10, if/else 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1922c629a2493659776f38fd4469a6073109846fb7a058c6050f6fb0e8fbdc"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeStatementParser.parseAlterStageRest (cognitive 18): SnowflakeStatementParser.parseAlterStageRest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, loops 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd3e92654a3dd0634a3ad1a160a84d21966060cd49b559b1bba2b5f74f3557c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cognitive 18): SQLServerOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 3, ternaries 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5003451f967a7e7dee73d57eeab3df7ae9b0508dc4b29afe5575ad497f31592a"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksOutputVisitor.print (cognitive 18): StarRocksOutputVisitor.print has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c808c08c3f4d0a929268794e474e826e26623dcd29ba9e14645d9fc9f2086528"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.exprList (cognitive 18): SQLExprParser.exprList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"126f4aeb223d91ba636245437780cb85f7c9288cfbc34b59b78c90fa9d590213"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseColumnCheck (cognitive 18): SQLExprParser.parseColumnCheck has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8d97a2e8a025190ee40cb07fcb45de01de15eec8372af32e3141ceb0612797"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseUnnestTableSource (cognitive 18): SQLSelectParser.parseUnnestTableSource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38a7d076f02c9316c3bbede791b30e3d6eb28b0eee00a16f47cb1a520500d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.alterResourceGroup (cognitive 18): SQLStatementParser.alterResourceGroup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f029981756b98360afa9b10bb8fc24f0fa1c89e6e8f39a2b88f0153411b880b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.createResource (cognitive 18): SQLStatementParser.createResource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7493}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ca1a09e3a7d740bb36ff021f5df91f2fd976607cfeb8535bd434a9aaa68da2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseAlterTableAddColumn (cognitive 18): SQLStatementParser.parseAlterTableAddColumn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":5219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1b08df93b57fc777e6e1cbdb98a686d6b1f9112650b732248e29124c7d2376"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.resolve (cognitive 18): SchemaResolveVisitorFactory.resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ae740d0d9c21de7a7d2ce86e49e5fecd90fd6c2d754e2ea0ff1a22ebfc10bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Greatest.eval (cognitive 18): Greatest.eval has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Greatest.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"50da988f03cfd4bd32be320a166db7a0f95374b932fe21e0ce5393de18d3320a"}},{"ruleId":"D2","level":"warning","message":{"text":"Least.eval (cognitive 18): Least.eval has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Least.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7183aa61eead3a628fed7132436835adcef3bc59401ed0ee5de55475768bfd54"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.isTableSourceAlias (cognitive 18): SQLASTOutputVisitor.isTableSourceAlias has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 5, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ceb0e813730503341cd2850e5e4ed229089923d0b556e826e30ae2e3a14073"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 18): SQLASTOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7619}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce91fb164994262af3c1e7765fcb3675e19a8b689163ec98d380abebdef573f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 18): SQLASTOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, ternaries 8, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":12457}}}],"partialFingerprints":{"codehealthFindingId/v1":"40882ac0eea8eda88c1737168e6ed1d913c9c1ef53062dbb3b27352699b106e8"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 18): SQLASTOutputVisitor.visit has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11, if/else 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fd1b02d4d4c82ad009d8255a8d7b3848d5f2825cff8e9d9bec3580a787d01c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLEvalVisitorUtils.visit (cognitive 18): SQLEvalVisitorUtils.visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"400052c63b693d0ddd39009ac7e95e4266fa192bc282d34338c369dde5cfce2b"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkJoinConditionForMultiTenant (cognitive 18): WallVisitorUtils.checkJoinConditionForMultiTenant has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294a025bab54d794f13dd95671dd81d459c635cf596eb401ba063219b3b891a"}},{"ruleId":"D2","level":"warning","message":{"text":"LogFilter.statement_executeErrorAfter (cognitive 17): LogFilter.statement_executeErrorAfter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, ternaries 5, loops 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":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbd872fb3e155912e34e265a956f2db6cf753ba7606c49adc3aef428c427686"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.fill (cognitive 17): DruidDataSource.fill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, error handling 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc951ebc697cb57e3e7e38f51abcb20ed0482a414751b7b270006a42cfa0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidDataSource.resolveDriver (cognitive 17): DruidDataSource.resolveDriver has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b57d169fd6ccca64a39872b3819546f890878dfae9825920a292258490db80d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBinaryOpExpr.and (cognitive 17): SQLBinaryOpExpr.and has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"62691077909cc9433230503939a62342314de174030ce9187a835fc90d4d02fd"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBinaryOpExpr.andIfNotExists (cognitive 17): SQLBinaryOpExpr.andIfNotExists has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 3, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"83acd8c62d0dfe7c7d5c11d761bcc490b436d20fe0d4038dcf9ef4b7d91d2c81"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBinaryOpExprGroup.replace (cognitive 17): SQLBinaryOpExprGroup.replace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 6, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExprGroup.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3fdeb6bedbc6821b2aaa61882d337fcd08d26910180f8d8397ffda386bc98e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLCreateTableStatement.isMUL (cognitive 17): SQLCreateTableStatement.isMUL has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae6fa48b0175809a170631222ebc1b47a94d6abceb76251e7b3c6ce207983d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprTableSource.equals (cognitive 17): SQLExprTableSource.equals has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9, if/else 7, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLExprTableSource.java"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0081b7387ac3e42753afa0c918472ef84c23ec8d457dc3785442449aaa5ba5d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprTableSource.setCatalog (cognitive 17): SQLExprTableSource.setCatalog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLExprTableSource.java"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d730ed4ca590b6c2867bab58779930fafee3a710651ce11d2d37ae8dacc1bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLIndexDefinition.cloneTo (cognitive 17): SQLIndexDefinition.cloneTo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 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":"core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexDefinition.java"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f912f7789e09e2da8356ab7093cce4c14b982dab6c6d2069918345634f52713"}},{"ruleId":"D2","level":"warning","message":{"text":"CKStatementParser.parseCreateMaterializedView (cognitive 17): CKStatementParser.parseCreateMaterializedView has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKStatementParser.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff86054e8d2a22590af8a4b653b4a6d81983de85c3ac9143b130d549dda8a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"CKOutputVisitor.printComment (cognitive 17): CKOutputVisitor.printComment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c78e9eb0e47029c774dee2535a73d1abf90bf89affe17d7f596812bb2a73d6"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2CreateTableParser.parseCreateTableRest (cognitive 17): DB2CreateTableParser.parseCreateTableRest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2CreateTableParser.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf19d0c665b4e5da77efebfd95b095e6723c917109e63bf1da9ecb3c0445ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2StatementParser.parseAlterColumn (cognitive 17): DB2StatementParser.parseAlterColumn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f328aac93b0293dc9c616323e4b8c81935cd62c5a60c53efeb8cc8f87ad851"}},{"ruleId":"D2","level":"warning","message":{"text":"DorisSelectParser.parseAfterTableSourceRest (cognitive 17): DorisSelectParser.parseAfterTableSourceRest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisSelectParser.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf8203c7c9b74b67583bc4a62e5c0051833ca1162eccf20e4edc1f6f14df497"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussDbCreateTableParser.parseDistributeBy (cognitive 17): GaussDbCreateTableParser.parseDistributeBy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d772313a08e727d30f55428d7326fdb78de756be4a1c92ba1c87f6951c905c"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveOutputVisitor.visit (cognitive 17): HiveOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, match/switch 3, loops 2, ternaries 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"074851d5bba77a90c716d06b3cbbe98a5e0d5b6aa177b560a5b087be8340576c"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveOutputVisitor.visit (cognitive 17): HiveOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, ternaries 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f098279b07259115f9b92273e7753194432008565cf639f3d51949769e402d"}},{"ruleId":"D2","level":"warning","message":{"text":"HologresOutputVisitor.printComment (cognitive 17): HologresOutputVisitor.printComment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hologres/visitor/HologresOutputVisitor.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa75a28a8d0f4f1adb8242237e13a549dba82ae4e5d07bc4299729392c733c3"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlCreateTableStatement.cloneTo (cognitive 17): MySqlCreateTableStatement.cloneTo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0be4b10655427631264f1e00e82bc109da9bd8c1dca751b1d3b95c067734644"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlLexer.scanSharp (cognitive 17): MySqlLexer.scanSharp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51860784c43e12ee1740071c2f19668f06f07e53d443ac75b4a449987aaeb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSelectParser.parseUpdateStatment (cognitive 17): MySqlSelectParser.parseUpdateStatment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6517d1d41a77f0709655f9f2579dcf877b4a84409a478b9925daa718acee8c63"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 17): MySqlOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, ternaries 6, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"496fc5fc1b4396956601fd09477b57e8de32839b9cd9c540539c752c9f7b05dd"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 17): MySqlOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 14, if/else 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb59d55b147bd1bfe77c812c7dc11a86741f4022075aef95794f12a08af8714"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parseLoad (cognitive 17): OdpsStatementParser.parseLoad has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5741f75a0a171f542e946e5b9d4c88745511f12927ec4ab2d9d7252b6771c726"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsStatementParser.parseUnload (cognitive 17): OdpsStatementParser.parseUnload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff89e81de1ae0124644f2f49fa748296da050f8abbbac682587ef3f403af27f"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.printJoinType (cognitive 17): OdpsOutputVisitor.printJoinType has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 13, if/else 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"91740a19d9fb2aa4fc54a8b2a03abe21dd99c291bb616051b1301690d781308c"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.parsePartitionBy (cognitive 17): OracleExprParser.parsePartitionBy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"681d5c9b905c9fb793e2a9b1498e062f8f3cffce288a7a46cdaf418b6a9fe6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleExprParser.subPartitionBy (cognitive 17): OracleExprParser.subPartitionBy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"920a0d834a32eeb82b2ad40923b21997bb32c269eb14a03bdaa8174cd2eedf27"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSelectParser.parseTableSourcePrimary (cognitive 17): OracleSelectParser.parseTableSourcePrimary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1cac27d5cbf2abb791a6d9424d9ba8cc01421d56e56463f1395ca10a54578"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleStatementParser.parseLock (cognitive 17): OracleStatementParser.parseLock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"02336ddaea28dd57c5757a41b80abd4c1dbd2d9e91d279aef037254a4c515180"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 17): OracleOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, if/else 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a2a4a11cf127dbd607068a89614d877ece87b4fc59d6d5bf134ffb951fee93"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 17): OscarOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, if/else 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"068eaf842be9c93a46585d1fd6d944e0060fec7303e90eec0b929c1173bb0014"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarOutputVisitor.visit (cognitive 17): OscarOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, if/else 6 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd58d06316fb384b34ee553faa02856023cf920fc515f1305ca68b6e26d848"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 17): PGOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"4154163d2b6b93b7eebfea53c9e01cd479e91fa265180db2512548caefe26080"}},{"ruleId":"D2","level":"warning","message":{"text":"PGOutputVisitor.visit (cognitive 17): PGOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, if/else 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5df3d4bac0f0b3863c7cda85ba04af21b39469a045a7f94a19d063d614fab4"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeExprParser.parseLimit (cognitive 17): SnowflakeExprParser.parseLimit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeExprParser.java"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af7f8e1a9dba64b18050fd5ad1daa3ab72f51ccc89cea21477c256f2d9331b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLServerOutputVisitor.visit (cognitive 17): SQLServerOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 6, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"548cc49b31f4b794ee136a03cd1fe3c41ca9b1a2773ac05f52b654ac4c06eaa4"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksCreateTableParser.parseCreateTableRest (cognitive 17): StarRocksCreateTableParser.parseCreateTableRest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df45bfc803c4678b7baf7f41c6a1080fc829ba769cbad57a05df66efe2680bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseAggregateExpr (cognitive 17): SQLExprParser.parseAggregateExpr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"36098a0b27e3d1d4a52191f87db63366abb0727cc04aa0b6b07c3e36528b6ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseSelectItemRest (cognitive 17): SQLExprParser.parseSelectItemRest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5790}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d6ed711e77a87bc04cf12dad1a76053da4dff4cbd91241bfb5322eb6ef0dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseFetchClause (cognitive 17): SQLSelectParser.parseFetchClause has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc249613ef76ae9c8d569baeadacfa2e45acb7e16e5862432656fd1089afc3a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectParser.parseLateralTableSource (cognitive 17): SQLSelectParser.parseLateralTableSource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e847b8de39f3a5a052c45e7acb2514b5e11ddcb75e6571cc3296c63a72601b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLStatementParser.parseStart (cognitive 17): SQLStatementParser.parseStart has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7919}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a5421c1aeea65a809b1086f1921bc4c4e9edbd2e95cae8336cf9d5e696c7da"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaResolveVisitorFactory.unwrapAlias (cognitive 17): SchemaResolveVisitorFactory.unwrapAlias has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0792a2bea43333792133d8cb3a88b266b42220c117440b02d7dbb8e5964cbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Substring.eval (cognitive 17): Substring.eval has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Substring.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"64947be4610d4c805a6c08da878794df072c7a3d99314ed0fbdd705d0a15e83b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.replaceQuota (cognitive 17): SQLASTOutputVisitor.replaceQuota has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"793c4028d7220c1e916ec3dedc44c986676e19efa4b9e5c34bd30bf01fa6ab85"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 17): SQLASTOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9, if/else 6, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4146}}}],"partialFingerprints":{"codehealthFindingId/v1":"df14caa9bbe870ad5ca2dfda2a498ec40fa59a60f36d883a686550ddb7135e59"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 17): SQLASTOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 12, if/else 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11288}}}],"partialFingerprints":{"codehealthFindingId/v1":"610af131b4a9b56ea2ec77cb47fed4bc6ff541ec9a14307738efae5ae8057e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 17): SQLASTOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, ternaries 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfade7c1f1ec96601f6ced60ab84ba92c9c61c7a77cad23710b26993d6cd28e"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 17): SQLASTOutputVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 12, if/else 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10206}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e1a1fd51c35fc129bc40d813037f49c11a6e4e6df3998c30455959cd408416"}},{"ruleId":"D2","level":"warning","message":{"text":"PagerUtils.count (cognitive 17): PagerUtils.count has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0e38efd3d7c4accdc50a65d5b1be5a1fe6d019abacb3d3196a8166fdcfaf5c"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcConnectionStat.afterClose (cognitive 17): JdbcConnectionStat.afterClose has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/JdbcConnectionStat.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f74e9877816089db2809cefee4bbe5331b7ad232a243e7b68dc64e96863606f"}},{"ruleId":"D2","level":"warning","message":{"text":"WebAppStat.computeUserAgentAndroid (cognitive 17): WebAppStat.computeUserAgentAndroid has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStat.java"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab5dafa073ac5acd531a3ed1a6df3dd68f9fe1c9e915e79030a0c7cb6e007e7"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractWebStatImpl.getPrincipal (cognitive 17): AbstractWebStatImpl.getPrincipal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, error handling 2, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/AbstractWebStatImpl.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cf2475742f4a70d12022f2c9f01b2cdbde9ce9bd1345d43b23573a783af4c5"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractWebStatImpl.getPrincipal (cognitive 17): AbstractWebStatImpl.getPrincipal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, error handling 2, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/jakarta/AbstractWebStatImpl.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9a7d8e282ce0848ef7d92b1737edbcd412128b7c4d180e0795630de2a989db"}},{"ruleId":"D2","level":"warning","message":{"text":"FnvHash.hashCode64 (cognitive 17): FnvHash.hashCode64 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, 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":"core/src/main/java/com/alibaba/druid/util/FnvHash.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41f95f1929b4c956f3c4c6d1d869722b1d44198b99a67d36b71b74345166686"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlWallVisitor.visit (cognitive 17): MySqlWallVisitor.visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/MySqlWallVisitor.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"83594e757090bb686eb5931fd1022739830178adc4d373ad78f055d5113f9ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.checkSelect (cognitive 17): WallVisitorUtils.checkSelect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d40c0fcff601ed1896ee62a4f9fa4c34aabe429444f01298619aa9ef6a02cea"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.getConditionValue (cognitive 17): WallVisitorUtils.getConditionValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a191d8f6797f6f576e93ffb8e62552ac2d334aedf94544f14cb4f5dc8e7e18"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.isSimpleCaseTableSource (cognitive 17): WallVisitorUtils.isSimpleCaseTableSource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"298423f0689f37850f1ccf475b9ec5cc782f24209d2ac01cd49e9790a3610a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"WallVisitorUtils.isTopFromDenySchema (cognitive 17): WallVisitorUtils.isTopFromDenySchema has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b6a8b1fe04d72c75a62e9bd8c4d18c79e63fb259d58e467ff2066cff39019b"}},{"ruleId":"D2","level":"warning","message":{"text":"StatFilter.resultSet_close (cognitive 16): StatFilter.resultSet_close has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b6eef6eedc682b2315b838975a1414fc996cf2c9967ebd87969dc2ca909434"}},{"ruleId":"D2","level":"warning","message":{"text":"PoolUpdater.removeDataSources (cognitive 16): PoolUpdater.removeDataSources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, error handling 5, 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":"core/src/main/java/com/alibaba/druid/pool/ha/node/PoolUpdater.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1d7280500d7884395ea8ad678fff57c1224e6e97bb508f7b7bc23d69f5e53e"}},{"ruleId":"D2","level":"warning","message":{"text":"RandomDataSourceValidateThread.maintainBlacklist (cognitive 16): RandomDataSourceValidateThread.maintainBlacklist has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 4, 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":"core/src/main/java/com/alibaba/druid/pool/ha/selector/RandomDataSourceValidateThread.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e376eea520fbcedf7934ee62bfe66d48975f4a6ec25757f7a5f979e11f9e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"DruidPooledPreparedStatement.close (cognitive 16): DruidPooledPreparedStatement.close has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, error handling 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledPreparedStatement.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af0ca60e9ceec1d5f0abf18c04f63c06a00f61d8ae0963673a54db193460694"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedStatementProxyImpl.\u003Cinit\u003E (cognitive 16): PreparedStatementProxyImpl.\u003Cinit\u003E has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"core/src/main/java/com/alibaba/druid/proxy/jdbc/PreparedStatementProxyImpl.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"759e49b6e6b085d02cb9b446fbb7695f1c5e774732903561859ea999911d9868"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLAggregateExpr.accept0 (cognitive 16): SQLAggregateExpr.accept0 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"87156ad88ee7a2148bf821a3c15d7295fc1e17114979a1c53d3ca9a10cb38e25"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLBetweenExpr.equals (cognitive 16): SQLBetweenExpr.equals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBetweenExpr.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd7f1c6d441ee6e685f19f8a147b667662854a2c8845967aa46c7793eefb25c"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLIdentifierExpr.computeDataType (cognitive 16): SQLIdentifierExpr.computeDataType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, ternaries 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLIdentifierExpr.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bc5180b136113dc3487c9a518a73f2b62b449a579e61dbf3c658750908ad2b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.findSelectItem (cognitive 16): SQLSelectQueryBlock.findSelectItem has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5a063cec762c4ed514a41bd132d9ac2c6a2a16290b296ae5b3dfa982fd400f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLSelectQueryBlock.replace (cognitive 16): SQLSelectQueryBlock.replace has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08cfca117147eb63794a7edcb9299f046cec1f3c8ed02f016801f61be67e50a"}},{"ruleId":"D2","level":"warning","message":{"text":"DB2StatementParser.parseTruncate (cognitive 16): DB2StatementParser.parseTruncate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8948673fe24cfdb92cc7fcaf739707afffde8d8e6b8283510f1015ddbb0f0f58"}},{"ruleId":"D2","level":"warning","message":{"text":"DmCreateTableParser.parsePartitionBy (cognitive 16): DmCreateTableParser.parsePartitionBy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmCreateTableParser.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5531d9ab16e92fb431373d79017767870564176b9cba2bb5c97b24cb279e53d"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveOutputVisitor.printTableElementsWithComment (cognitive 16): HiveOutputVisitor.printTableElementsWithComment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3e5b9448810f43cbd769a8739ac9800a65c4a8bff0cd592ce73f667b494055"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUpdateStatement.equals (cognitive 16): MySqlUpdateStatement.equals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, ternaries 5, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlUpdateStatement.java"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3f756787b0e8e0e991b1fea8d3566c50123801e35b8d48f1831e2fa6e69157"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlExprParser.userNameRest (cognitive 16): MySqlExprParser.userNameRest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"5760f5a45a597cfb73b907ed8f67e52ed8c38d8fd11a41bde99de237c0d09716"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlStatementParser.parseCreateFunction (cognitive 16): MySqlStatementParser.parseCreateFunction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8221}}}],"partialFingerprints":{"codehealthFindingId/v1":"913336cd150dabac444fcdc8412b41ece8cf7fe61cf15ce72e73fcb69d3b8344"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 16): MySqlOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 5, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc26ab54e344bd1ec29877753d3e6049a4a820479d9b406d98a02cb719178e7"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 16): MySqlOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 9, if/else 6, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3307b9caecb82dea96c602d7a4a7bcf6d1f9355e0038a9bc34bf5783c056cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlOutputVisitor.visit (cognitive 16): MySqlOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 8 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4877}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43a0703cdd91592e6a85c0ce4c8b95f72f6e9f5db85fe9ed4ede109831bae87"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 16): OdpsOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e25181f233d4b2e1eeb3cae775f7fd67d2fdefd1cae863ae1872a3b2dd818d"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 16): OdpsOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9dc98eba9b7d08bbc7c2b69c2422ca6d81ef31e18754162fb55c661d7746f4"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpsOutputVisitor.visit (cognitive 16): OdpsOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 10, if/else 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad876392499da319ad61f9c53c00cb04bbe15e74b20a9bd3334fa25ce92828b"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleOutputVisitor.visit (cognitive 16): OracleOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, ternaries 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8593792355a475a51a2e95eed1239fa4419ab9e14f317480e2b529823ffb9b"}},{"ruleId":"D2","level":"warning","message":{"text":"OscarPermissionOutputVisitor.visit (cognitive 16): OscarPermissionOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, if/else 6, boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarPermissionOutputVisitor.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0182f57fccd87aae2708f72fbfd4e1cb7251c3bed61c10bd35b8024c8a53c73d"}},{"ruleId":"D2","level":"warning","message":{"text":"PGSQLStatementParser.parseDeleteStatement (cognitive 16): PGSQLStatementParser.parseDeleteStatement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6ab47dd0fcabf77469765e6d72e3efa1ecef8597a5fe3dd01dee339f3ad18b"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeExprParser.parseJSONObject (cognitive 16): SnowflakeExprParser.parseJSONObject has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeExprParser.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c0b4315db7a1935830cf521bc20dc38fb88acc86bc72acccf8dd7a195059d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeSelectParser.parseTableSourceSample (cognitive 16): SnowflakeSelectParser.parseTableSourceSample has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"713c1d1daa3f1a7d3e74a38784f2bfb0dc4e27a839f61de14e2aab23a26538fe"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeStatementParser.parseAlterWarehouseRest (cognitive 16): SnowflakeStatementParser.parseAlterWarehouseRest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 4, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"379c4971dfabe056756241a5b6ef296b92cd1a3fa1205e667ab2f10bfda26a23"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLExprParser.parseWindowingBound (cognitive 16): SQLExprParser.parseWindowingBound has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdffe45c9b8cf6ebabfe73e926e5153b1de872324477f17497d7f59a0c975e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printComment (cognitive 16): SQLASTOutputVisitor.printComment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7229}}}],"partialFingerprints":{"codehealthFindingId/v1":"731d213918852f01916ec10dc2570be982ecf2137bc85434788c3f0f5a456c07"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.printExpr (cognitive 16): SQLASTOutputVisitor.printExpr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"828501833ac788346392394cd39224a304c88d3c0f66427f146418bfdc1e61bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.unwrapShardingTable (cognitive 16): SQLASTOutputVisitor.unwrapShardingTable has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 7, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41697ffee3c70f0d868ab62bbc7d4c77e6c725515e78dd713f7cd2ba232b83b"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 5, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8993}}}],"partialFingerprints":{"codehealthFindingId/v1":"9896761e2bb84d26441488a0b4bf6c351dc7099e6b19768a143c6796b788d869"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37d7ca66d12a20c84612a2470568d4c62ffc1f987c8f173a00620437fa35d46"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6b21b0a3eced4f65c16f76b60929087a510fff6510168a24e6a03b257b4575"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a024c355b8aa95a4fc22776ea7a3e5e835b9a324a9e69ebbfde3b36cf72788cd"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 7, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6526}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b9524c1450e3b6cc8cf01e760f11ab427f2b8b615f65fc5ca691192a1f5811"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 2, ternaries 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8ebcf950e74ed494333341a16300bd8d4c9e29cd741321ec607acc0a6027e6"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, ternaries 6, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10769}}}],"partialFingerprints":{"codehealthFindingId/v1":"583adda8586efc85e3dcce4aba627cf88066ff3852dc478953dcce3b8bad7729"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLASTOutputVisitor.visit (cognitive 16): SQLASTOutputVisitor.visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 7, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5934}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d1911f06b1fd7a9e4b7c20f0d0c59fe1dba1b4d4557ab6f272b2b83e04ca73"}},{"ruleId":"D2","level":"warning","message":{"text":"PagerUtils.limitDB2 (cognitive 16): PagerUtils.limitDB2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8034aee96c27e14c76c45e6f002dbaf1382943b042767a4daa264497f1db04"}},{"ruleId":"D2","level":"warning","message":{"text":"IPAddress.parseIPAddress (cognitive 16): IPAddress.parseIPAddress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 2, error handling 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/util/IPAddress.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"374395f9c590e51df6a94dbd9242a86192f8d5f64c91bbd4f127a76f3c7387d0"}},{"ruleId":"D2","level":"warning","message":{"text":"StatViewServlet.process (cognitive 16): StatViewServlet.process has cognitive complexity 16 (threshold 15). Drivers by points: error handling 10, if/else 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/StatViewServlet.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"87499c1fc14d35da5bad3c04d11c47120c746917ca1356c2c5c83f56d1376b20"}},{"ruleId":"D2","level":"warning","message":{"text":"StatViewServlet.process (cognitive 16): StatViewServlet.process has cognitive complexity 16 (threshold 15). Drivers by points: error handling 10, if/else 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/jakarta/StatViewServlet.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d64e0332eb4508e1974b08a7de9be5d747b72a7eb04bb978087f226219a88e9"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONParser.nextToken (cognitive 16): JSONParser.nextToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 1, 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":"core/src/main/java/com/alibaba/druid/support/json/JSONParser.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"637f5db0b6f368148f125693bbd51b4b62a9b83dbfbe5fdea0ff82d7ccfda1d9"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlUtils.decimal (cognitive 16): MySqlUtils.decimal has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8, if/else 7, 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":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d0e114d24ee8fe620681bb3cbe1df8d3aa0aea29921432408862df345f08c5"}},{"ruleId":"D2","level":"warning","message":{"text":"WallProvider.checkWhiteAndBlackList (cognitive 16): WallProvider.checkWhiteAndBlackList has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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":"core/src/main/java/com/alibaba/druid/wall/WallProvider.java"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"86359ae5e070085033f92e14416bd037de7acaef55f13c4b979c3c263468756b"}},{"ruleId":"D2","level":"warning","message":{"text":"template (cognitive 16): template has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"druid-admin/src/main/resources/support/http/resources/js/doT.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee4967762995aef2eb3f7296cbc0724746d1774787714eb24fa0b11b5d91246"}},{"ruleId":"D2","level":"warning","message":{"text":"template (cognitive 16): template has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/resources/support/http/resources/js/doT.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c54d8700f901769943effe1649abfe5c9cad7fd3b8613c886b89ac18f1376e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FilterChainImpl: TooManyMethods \u2014 496 methods. Most of these members implement filter.FilterChain (295 of 300 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"299ef0b16b3e7e0e58d18ca8cfef3230307cc8fbfdc4be184a353d6cf16d49d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FilterAdapter: TooManyMethods \u2014 489 methods. Most of these members implement filter.Filter (294 of 295 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/FilterAdapter.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c583d4956ec7ec9cd89d56f3712eed932d64febb32205849f42c0eba09ce59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/MySqlStatementParser.java: FileTooLong \u2014 5735 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67a7dfc4f2a96f67f67844253c5de014f86ddd2443e776faa66caa2f887d5d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/SQLStatementParser.java: FileTooLong \u2014 5465 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SQLStatementParser (49-7983). 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4c084cbe8140c330a5326f3e8c6b87fc62a97c0360798f71dd7b2fc2d92e20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/SQLExprParser.java: FileTooLong \u2014 4815 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef12e883e9a78d26faba2c759e94279f7cf0d85cf7afa5e54ed71c8d810755ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidAbstractDataSource: TooManyMethods \u2014 262 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab53b704b134f9e48d430255eb562944c75c434438da46e16b1db000d59eb17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLStatementParser: TooManyMethods \u2014 246 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5857f8d94753d4869d8fd1178bb31566603213187076c9cf0dda013d2747446a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlOutputVisitor: TooManyMethods \u2014 225 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e844280f7a4ddf43ec7dbecdb42b07ad9a16329dea5fa820aeb436b5371cbb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/MySqlOutputVisitor.java: FileTooLong \u2014 3746 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: MySqlOutputVisitor (41-5722). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1ea51a60ad04b6e6b57157a5bae3ecb6aa5d64601b7835916dc16c5b5eb7e6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ResultSetProxyImpl: TooManyMethods \u2014 219 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/ResultSetProxyImpl.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2287400fd16bb6af0acc02d062706ff62b61b17e8e45c1779ae9dcc7d8db85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filter/FilterChainImpl.java: FileTooLong \u2014 3453 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: FilterChainImpl (36-5287). 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":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b3b1cd5f3f4876237194076d1281bf4647910a545e4c7f412df38b7222d0d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SchemaStatVisitor: TooManyMethods \u2014 207 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b468de6f939bd52239ddf037b35f89ac771ad9098feffefcec66320207f9c20e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLExprParser: TooManyMethods \u2014 199 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7548c9be71eacba9e9c928ca0a70894790bf021f2595af9b722a5e1ed3f82d18"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidPooledResultSet: TooManyMethods \u2014 194 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidPooledResultSet.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a9a739b0ca32fad61ee47b7a3ff62dcc9e5f8cff5a5e04374eee22aa31fd94"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ResultSetBase: TooManyMethods \u2014 192 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/jdbc/ResultSetBase.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c6c15175fcc20f288ff9ec676bc99e64941c36ed8dfadbd630c991345a96f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseMetaDataProxyImpl: TooManyMethods \u2014 177 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/DatabaseMetaDataProxyImpl.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ef612c7dc293afbbf5025d51dff67979656c68d42d734449a0eca83e34f49f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WallConfig: TooManyMethods \u2014 166 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/WallConfig.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52eebe5334b53f0ffce919b1328b3603d8ee2bf6586f490436f8002235f5bd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PGOutputVisitor: TooManyMethods \u2014 163 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bac733a625025e474b08b09c23e9407717f01231d1e317b395ce83977f1736"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WallFilter: TooManyMethods \u2014 161 methods. Most of these members implement filter.Filter (97 of 127 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/WallFilter.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05d74c5727a1bb464c3720445413453866313fc59961fe6017d8f13a1052b65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/DruidDataSource.java: FileTooLong \u2014 2560 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: DruidDataSource (81-3991). 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":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"284effc305013252f2cebf7ccab8d2bde93c875b5a52e90efe5bf359a4b1e04d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateTableStatement: TooManyMethods \u2014 152 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8bfd23bfee1fd107ef59ff29bc6452ab67d488146e46bc2392498b9442a91f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlSchemaStatVisitor: TooManyMethods \u2014 151 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlSchemaStatVisitor.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1c09bc9f7ea383fd84a503c5ae2af0f821c32c817d7d5536df44d6bc92398d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/Lexer.java: FileTooLong \u2014 2500 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: Lexer (41-3524). 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95495a8f88a282a63d1594d71231fb1ec744ad06038acf658596e65aeb5e825a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidDataSource: TooManyMethods \u2014 144 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fadc13865d5e7b363035ea7371cf122adad3b853c5aea53369118d3f3f377c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/OracleStatementParser.java: FileTooLong \u2014 2238 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: OracleStatementParser (37-3175). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1e50f09b48a6fc899494a727afa440f4a3d4b63fd6d1152a7bdc51e066bec1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlStatementParser: TooManyMethods \u2014 132 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"571ba75446efe516fbe222f56606f6d8d7646bbc34537d0b6e397e80a20b22a4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OracleOutputVisitor: TooManyMethods \u2014 130 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b48e55aca0c4928ab3ba6475d6760d52a27f1bed206eb75eed2bc06dd71ee0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebAppStatValue: TooManyMethods \u2014 129 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStatValue.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a38f1bab3335d5ede8eb6b8edabd05d38ae83efe359e34796b691ceadde98c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLUtils: TooManyMethods \u2014 128 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"feff872a90a74f81926b0e7956d834287c094ddb845da4ff994d4b1c3854ddd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLSelectQueryBlock: TooManyMethods \u2014 127 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d03a70b8f4187d45f1bfdf8a46de6af15475f66913dc38b9dac2709789a036"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/SchemaStatVisitor.java: FileTooLong \u2014 2074 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SchemaStatVisitor (42-3341). 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SchemaStatVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60b776d897cbf1c4bf5028186034842409ce01f762916ebf3f076c45ea69cc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/PGOutputVisitor.java: FileTooLong \u2014 2071 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: PGOutputVisitor (44-3126). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4230973298de4727f4063a6c880d997f254abd97c9c9b1ea5fd9a28d557731"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OscarOutputVisitor: TooManyMethods \u2014 124 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f410da6cc3cb55800b9c9009b1d624cb9c5db9f10b6e34088581adb66aaf358"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: TooManyMethods \u2014 120 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f5f9d7324669c0806a384b981babf2c57749bd8ec0bbe159a4bd7ca120e500"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/OracleOutputVisitor.java: FileTooLong \u2014 1988 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: OracleOutputVisitor (46-3011). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c909222fc2c86456daa40f5478da72f311a62b3e1435d7b61d5f1c9ad3ba996f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidPooledCallableStatement: TooManyMethods \u2014 117 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidPooledCallableStatement.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e817d68c1898a88d14866cec067e907713a43a940840107186d0ef6fa0cdd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CallableStatementProxyImpl: TooManyMethods \u2014 116 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/CallableStatementProxyImpl.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26d526260e0a47b09e76e203e8e0211bb030d613896620ac34a464c9444fed2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/MySqlExprParser.java: FileTooLong \u2014 1919 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: MySqlExprParser (41-2689). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"531434981f0407229934b1e1e75c831a65f17e80717304c9b930ca8f43de70f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MockCallableStatement: TooManyMethods \u2014 115 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/mock/MockCallableStatement.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e468b1443513c7496853cb6c641983919b5cacd383c06cf07fe49a809060397"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filter/FilterAdapter.java: FileTooLong \u2014 1874 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: FilterAdapter (38-2891). 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":"core/src/main/java/com/alibaba/druid/filter/FilterAdapter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"084a0d815ec75de95478af8c975942c65cad6a1395ae7f5b1a406460ac49407d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLColumnDefinition: TooManyMethods \u2014 112 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLColumnDefinition.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e2a05e01cf2e925dede98c72a9597c421ab008b0d4ce485b50dfb4b3d9143a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/SQLSelectParser.java: FileTooLong \u2014 1735 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SQLSelectParser (33-2554). 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb2151e03366bc1200bd16294bc00060df664be99ba4901f577f9ed8820473b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogFilter: TooManyMethods \u2014 104 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee0a9250fa891827523c7864d30f96da67db650701268da6003522d7c6baf40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: spi/WallVisitorUtils.java: FileTooLong \u2014 1732 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c383c311d59571fc63f4d44b82bb11ecac4d6f2bdeae521303bdd42c8f38bb03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidDataSourceStatValue: TooManyMethods \u2014 102 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSourceStatValue.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd0b5a65459b69dffa4751a55ba625c49739ab10382d105902a17da4de8f98a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidDataSourceC3P0Adapter: TooManyMethods \u2014 100 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSourceC3P0Adapter.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a826f0dff17c262e885e544f7a27d985daeb2186c0c76b9db3bbf7cfbfecf11"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JdbcSqlStatValue: TooManyMethods \u2014 100 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/JdbcSqlStatValue.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4fab5ee99df2fe4c53587decfc4f1c7f1bcf987a3343f49f740a5cc8eda831"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebAppStat: TooManyMethods \u2014 99 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStat.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2825d7c6bae851a7d7c87c61ca2a16d731e6283fa804cf35a1138b602f0bc04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/SQLUtils.java: FileTooLong \u2014 1588 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: SQLUtils (95-2609). 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":"core/src/main/java/com/alibaba/druid/sql/SQLUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b2869a76f2531a58cbbe4222e75e01e093f47e76c3fd09781f389c4b324ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidPooledConnection: TooManyMethods \u2014 95 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e97591fe9e3fa078039289b502267befb1297b0d948c45bc86a95195763c7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/OracleExprParser.java: FileTooLong \u2014 1578 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: OracleExprParser (40-2184). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eb859113f3c6295c263e6d3887e980d6f5794e602378d12fcc776df155073f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/OscarOutputVisitor.java: FileTooLong \u2014 1566 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: OscarOutputVisitor (40-2397). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57633192e580b2d31378e5cf72c9afd7f625ccb772f3d37ec98db932646bcd40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repository/SchemaResolveVisitorFactory.java: FileTooLong \u2014 1548 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SchemaResolveVisitorFactory (53-2466). 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f751f8d886225a5030be61e459189c713ad30f98b2330a8d1bb272e4f6a8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/MySqlUtils.java: FileTooLong \u2014 1507 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: MySqlUtils (36-1995). 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":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1098fde07c76ca280a93971ccbe3220fde4d41b5e835f5dd147870265578d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HighAvailableDataSource: TooManyMethods \u2014 87 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/ha/HighAvailableDataSource.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3edbbda52921cbe89bfedc4e6427b565503df4a06d1b8e6144e7529f2d38183"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateMaterializedViewStatement: TooManyMethods \u2014 87 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateMaterializedViewStatement.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ec864cd64d9923a3d44ee232130540a58325c19108864959d51724af6dba7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/DruidAbstractDataSource.java: FileTooLong \u2014 1430 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: DruidAbstractDataSource (63-2389). 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05547c23ad8eece8a5a1ae88dedb97a0968dd99bed8cb4281ef420980783039"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JdbcSqlStat: TooManyMethods \u2014 85 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/JdbcSqlStat.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d092f419c9937c8b9eae134a8dd01d673c650eace8c4492b9e8e8e67e5fa8a7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/SQLEvalVisitorUtils.java: FileTooLong \u2014 1361 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SQLEvalVisitorUtils (47-2167). 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f34e012bbfde35197d1bab8b657200d086afeb940a7df6b1bf9fab6d0c607cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StatFilter: TooManyMethods \u2014 80 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c29fc0955f682c5786622a71b05e67494af7180ed0fbe3a448fe3248bc79cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: calcite/CalciteMySqlNodeVisitor.java: FileTooLong \u2014 1333 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: CalciteMySqlNodeVisitor (25-1844). 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":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5873f3112289bc70093eac0701542f7fb7f3f9ae0a36a6ecbc2f15acab79f83e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedStatementProxyImpl: TooManyMethods \u2014 79 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/PreparedStatementProxyImpl.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f014c69c6d4cb0b1b1ff0bbd38d9d64b35530e42b093b00fbf601088390bebe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WallVisitorUtils: TooManyMethods \u2014 78 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/spi/WallVisitorUtils.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652eca22af64d85b32398ebbbb1cdca2852934f20c0e01847d80f61dc008d4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/SQLASTVisitor.java: FileTooLong \u2014 1282 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SQLASTVisitor (40-2925). 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da70a8b501931bac88a4d385b35230996d3f271599e315bcac5e9ad53f3c4f91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidPooledPreparedStatement: TooManyMethods \u2014 75 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidPooledPreparedStatement.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daafb14041251d2e64c7ede33bdebe787ab1e948ca1d2a0f78723c529af869a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CalciteMySqlNodeVisitor: TooManyMethods \u2014 73 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc5897887912ea9596908f26e11f5becc15fab59e3fb8ba43ad452f7c4f333d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/OdpsStatementParser.java: FileTooLong \u2014 1193 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: OdpsStatementParser (45-1755). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df64dc308e578a71aa3475612d9f4b312d4d1cec5ae0a0db772561f1d95df03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc/ResultSetProxyImpl.java: FileTooLong \u2014 1179 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ResultSetProxyImpl (33-1666). 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":"core/src/main/java/com/alibaba/druid/proxy/jdbc/ResultSetProxyImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2e08707d7dfd6266949f882bc10005fe9d4fb80b7e8a7bcdf65f5148f1680f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/DruidPooledResultSet.java: FileTooLong \u2014 1166 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: DruidPooledResultSet (27-1770). 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledResultSet.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcca0529d41d37d9d343a3bebb005194b90ec53850576792ec43382528333ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/MySqlCreateTableParser.java: FileTooLong \u2014 1142 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: MySqlCreateTableParser (35-1616). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfbc4407e6a160cf9374cffe0c0c4236df30c2946fd09ab7b2ba067feac6db8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wall/WallFilter.java: FileTooLong \u2014 1135 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: WallFilter (44-1657). 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":"core/src/main/java/com/alibaba/druid/wall/WallFilter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d9f26cadaa60f27d3f44e73e99dfc98c535bd901525377ed56fa007582309b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnectionProxyImpl: TooManyMethods \u2014 65 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/ConnectionProxyImpl.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fea9f259912b5680a216305ec2b22a0b1a4102e484f16d67d45d1db4b9aeeb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OracleSchemaStatVisitor: TooManyMethods \u2014 65 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleSchemaStatVisitor.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae7294c3aa39f7ab59054129a42cd69ebc378202dc68a8cb6d8379595fdb9cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProxoolDataSource: TooManyMethods \u2014 64 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"druid-wrapper/src/main/java/org/logicalcobwebs/proxool/ProxoolDataSource.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0cb84b216f8a6e84afef70da3368f8d4743ab6301929139e34e237e00392b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StatementProxyImpl: TooManyMethods \u2014 63 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/StatementProxyImpl.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b64822cd95bfbfeb3e673316275ac27a89ffe817efe35fb211bb60e44f9ecb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/PGSQLStatementParser.java: FileTooLong \u2014 1040 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PGSQLStatementParser (36-1490). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca69a817ce0e6655c911c2e24096a2599a19123693742bef87dad9cca8e6549"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OdpsOutputVisitor: TooManyMethods \u2014 62 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9022b8f70ededa172ce83c91023600f478e96fb9b82b261049c36f21bc850d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: statement/SQLCreateTableStatement.java: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SQLCreateTableStatement (37-1747). 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a15083a6de3854a38b040377c625149601c65c27939fe597919e3876af1d4a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MockConnection: TooManyMethods \u2014 61 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/mock/MockConnection.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39d3837dce885201d9e4f6343bdeb44a04605137033c787bf0b55be2196a7bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WallProvider: TooManyMethods \u2014 61 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/WallProvider.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9a7ade2641df4d2a2c03074caaae0af3cc92c0b77c1bd356c62ccc121bd8dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: statement/SQLSelectQueryBlock.java: FileTooLong \u2014 1014 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SQLSelectQueryBlock (32-1725). 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8063e4521b6f11e3101e87cc8216f812c87d8aebfe3fe1f137da2433cfd96941"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/FnvHash.java: FileTooLong \u2014 997 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: FnvHash (20-1185). 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":"core/src/main/java/com/alibaba/druid/util/FnvHash.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9657c168c85fbb13998a7324000d1605c2971c1599dd78c85bffd35e836e8b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlCreateTableStatement: TooManyMethods \u2014 59 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4f3e35a26eeece9b6983d6990924ab5529c5a3e5d8402749bddb3e75f0c82f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SchemaRepository: TooManyMethods \u2014 59 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3559339438daf0eab87c9153bea58e1e020729c8e7166f4df4e425b85b6336c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidPooledStatement: TooManyMethods \u2014 58 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8f906f0cd6c2420da4c025362f051e721eb48c86ce716239e985b015461805"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLSelectParser: TooManyMethods \u2014 58 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"952d5a1ddf380439bd0358a1ae12120d3d0c7e06b9bd975bf4949235597565e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EncodingConvertFilter: TooManyMethods \u2014 57 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d9c445f982a67e9e0cad50c05ed249cb56c44fd5bf803e5254508226931b42"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLBinaryOpExpr: TooManyMethods \u2014 57 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d04e7ecca080d4994e3dae99729a6f8d6a107667926a35df1bbe64b6d6d6d8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidStatementConnection: TooManyMethods \u2014 56 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidStatementConnection.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b53241f6dcf4b85f43c7abc9d2e48f55222c08a837747ed3ec0fdf562573a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateIndexStatement: TooManyMethods \u2014 55 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateIndexStatement.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae3481536bdaeed538003060194a6274e166b88b442f9a2012a75873a354e5a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StatementBase: TooManyMethods \u2014 55 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/jdbc/StatementBase.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bc13ed55519ac7dbfd7d0b8ae72c2b7b238ff8cd53ea4af1bc63d523a665e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLAlterTableStatement: TooManyMethods \u2014 54 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableStatement.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d699f4897310eac2376852eb270c0d40dbf92aa366005bea4db29301560a0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateViewStatement: TooManyMethods \u2014 54 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateViewStatement.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4feea11aa4f8718225f56060c5ae91c6798d5a2c7ca0bcb2653a32527327aaa1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OracleCreateIndexStatement: TooManyMethods \u2014 54 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleCreateIndexStatement.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"690ef82f9331a7e4a614e7a992fad0b8aa5dc6159e04990e7e6a558a9c337fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebURIStatValue: TooManyMethods \u2014 54 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebURIStatValue.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6fc87bf6b738e8cb2dc8d894a178e9dcdc9f1be4b35343044201d825c3861f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedStatementBase: TooManyMethods \u2014 54 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/jdbc/PreparedStatementBase.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"40901da4d2763be5c08db6f9435accaf9fb32b30dd4653cc6c4d947eb71c0938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/OdpsOutputVisitor.java: FileTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: OdpsOutputVisitor (37-1333). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d408642b8e46575902a984226de5233ffa7d7821650d57e0add7ee21e88a5c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLIndexDefinition: TooManyMethods \u2014 53 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexDefinition.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3964ca82e35c1af72a918ee620664c3608134e8cdf92c6a17e6b522a90cb667"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OracleStatementParser: TooManyMethods \u2014 53 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4232f4a0eb87eaa094e44979f0f98c87d61a1bae9778cfa5aa0753deedbf0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLEvalVisitorUtils: TooManyMethods \u2014 53 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"847d1b01f443c9e6d1f39fc822bae2477aced2ffff32958295891a6e693c7612"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLJoinTableSource: TooManyMethods \u2014 52 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLJoinTableSource.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af14f8a49c05546d4f35ea05ad75a149818b32347ced69984018507aee2840"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OracleCreateTableStatement: TooManyMethods \u2014 52 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleCreateTableStatement.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8e57a03dc4ff4f220a8bad284a98b9a92554281b53cfb6d790c6d8be4e6c3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/SQLParserUtils.java: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: SQLParserUtils (126-1199). 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcb690206d5a8d51915830260fdc2cfe48e919057cecc1757eae3614053a0ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filter/Filter.java: FileTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: Filter (35-1378). 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":"core/src/main/java/com/alibaba/druid/filter/Filter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee26c4a71c6de34eccd27c4fefb819b1015fd92772058bd901b440b6df6704f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SpringMethodStat: TooManyMethods \u2014 51 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/spring/stat/SpringMethodStat.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a9dc1f26673ddb6fc78c941018899390dafb6024d6564160f5c1bc364d3441"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlFlushStatement: TooManyMethods \u2014 49 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlFlushStatement.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f29fd3f1b41d1fd75cd164d1ae2c16f781dd4bde979bf9deb967e5531393b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlExprParser: TooManyMethods \u2014 49 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3473b81094e681f2ab31c1c3751a03fc0a7a33e085f1d0850ea01c53c34338b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repository/SchemaRepository.java: FileTooLong \u2014 801 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: SchemaRepository (54-1279). 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43870307278b8eebba4835848c8979130e625d3efee4e44fc887b03c23a5e34"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLMethodInvokeExpr: TooManyMethods \u2014 48 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fd25d35c6abe0026c5e41e5e605f16b98ae1ba553999774267e6ae1b1d7b83"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateFunctionStatement: TooManyMethods \u2014 48 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateFunctionStatement.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfdaa81052dc6787bf1dbd667560539183d4e368be01a53f7a0f0e7d732f96a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JdbcDataSourceStat: TooManyMethods \u2014 48 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/JdbcDataSourceStat.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de604f6f9a32a60decdcd09a78714baeb7a1dfc795220a0e72f13ba2124fdde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stat/WebAppStat.java: FileTooLong \u2014 787 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: WebAppStat (36-1186). 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":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f08011d58ced812c852171891d98a60b9c0da54a69be0de518f3bf06faa6a85"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PGASTVisitorAdapter: TooManyMethods \u2014 47 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGASTVisitorAdapter.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2f5db47d304ea20d5e3c67ad4aae2aa3eb566f7b41e6e028526e05ef2b5835"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/DruidPooledConnection.java: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: DruidPooledConnection (43-1298). 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92e44e746970cea05dec6a9e6a5fa0838a5f413308c60faddae0a2ac8de28b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebURIStat: TooManyMethods \u2014 46 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebURIStat.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"db59f0911de7a99764d953488e10f869c50574f0ed243b8c76d2e1a69ae4da53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/JdbcUtils.java: FileTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: JdbcUtils (34-1060). 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":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8063348ce4ffa92862c546206453a5faae8e5129632fb985b7e2c96981f30e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/SQLParser.java: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SQLParser (27-970). 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da96e166586d7bccefbe7c3f71bfcfa44fb2a1e3330dcd06661725ef82f1252"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MonitorClient: TooManyMethods \u2014 45 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/monitor/MonitorClient.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a968a3dfdb4fc9f30a9fc59c819b483796d86da0f8e24a5a487b1a322722abcb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SpringMethodStatValue: TooManyMethods \u2014 45 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/spring/stat/SpringMethodStatValue.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee282b30100320cdaf72864349f64a889e2bedf25a19dd8aeb87f08285ef5959"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/OracleSelectParser.java: FileTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: OracleSelectParser (29-1127). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bcfd78b0e35c6f027b1aa403fc9cca64bad44f8853dd8789eafdbdaee5ac9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stat/JdbcSqlStat.java: FileTooLong \u2014 719 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: JdbcSqlStat (33-1078). 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":"core/src/main/java/com/alibaba/druid/stat/JdbcSqlStat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec45085f1eb0533c8c2c0e9c9f514cc7caac9695d1599ffed1158d9721e23f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLExprTableSource: TooManyMethods \u2014 43 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLExprTableSource.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccf65aeb829b8a751b10610fa0a21f1f1dc7273e894fc5749a878ca37145478"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlTableIndex: TooManyMethods \u2014 43 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlTableIndex.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ad22d22d395eed5874d80bc79bee14d78deb22ed43c1fe3d21da2375ce65cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MonitorDaoJdbcImpl: TooManyMethods \u2014 43 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/monitor/dao/MonitorDaoJdbcImpl.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d433c848b461a8c07a7b90a9f5e4ebab7e00a6bb7de9830292fb482512ab622"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JdbcUtils: TooManyMethods \u2014 43 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/JdbcUtils.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71ada06eab0dd72a6207689d8bda0631e656f3def7964cfccad8a5640314e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stat/StatFilter.java: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: StatFilter (47-1136). 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":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"262dbe9b331ec25e9c9183c1b4b3801c3353bcbd4f531d8f2db71d91e349a78f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/DruidPooledCallableStatement.java: FileTooLong \u2014 704 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: DruidPooledCallableStatement (29-1078). 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledCallableStatement.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"511ffbf40e720883bec5c2956794b135acfdd0bfb105fdfb9ae378cf363f61c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dao/MonitorDaoJdbcImpl.java: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: MonitorDaoJdbcImpl (54-1062). 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":"core/src/main/java/com/alibaba/druid/support/monitor/dao/MonitorDaoJdbcImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1850c344576cff033dbe0452a4ef4722a318432bf86dcdd04a7ff70584eafc83"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DruidConnectionHolder: TooManyMethods \u2014 42 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidConnectionHolder.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"433eb35e33fb9e4477ef9bdc76d7cccd9746a9e906c9e83db5fb2a194bd23af7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLPropertyExpr: TooManyMethods \u2014 42 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLPropertyExpr.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3028be2269d4e0eb1c137b9b18a32da99acae5534a12a16e7d793d5deaf15c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/SQLServerStatementParser.java: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SQLServerStatementParser (33-1070). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e66a53843fb269b98834b578b1d93cf36b21915de2a112ea638826487440c0e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FilterEventAdapter: TooManyMethods \u2014 41 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8893df4a9c1be4a53cab14d1948e159d9be533b3cfd79b95eaa53906231372"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateSequenceStatement: TooManyMethods \u2014 41 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateSequenceStatement.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0909c8d6669622a0506cfae83a93dea33cf3eac5d0139b7b3157971be424df9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PGSQLStatementParser: TooManyMethods \u2014 41 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe3d6cff9ce2f8c601dece7a55b2a3a6a0139ac298bb8a8eeeaa2c5f2cf5a77"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebSessionStat: TooManyMethods \u2014 41 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebSessionStat.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ef914e54fce167d6b9629d741353675babbbfd52abb82570294b05422b24cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebSessionStatValue: TooManyMethods \u2014 41 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebSessionStatValue.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b118324d2d7c9ee8b9d2d2c233470fb99608fb5b5c20c77f0b9612f29b0f018"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColumnMetaData: TooManyMethods \u2014 41 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/jdbc/ResultSetMetaDataBase.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6289f1ebc677795cf099e9ea189c1a0c508c6a665307ff6d233fb8652caf7424"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc/ResultSetBase.java: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ResultSetBase (26-1173). 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":"core/src/main/java/com/alibaba/druid/util/jdbc/ResultSetBase.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a1d4ad59535867e4bf04051b599dd7a4908cb580f5fc1fb72473e88b5f2938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filter/FilterChain.java: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: FilterChain (35-1192). 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":"core/src/main/java/com/alibaba/druid/filter/FilterChain.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d935584aeb2d84c3223a7307495bd660b1e67b4fecb3c5d8e802d6347f33277c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/DruidPooledPreparedStatement.java: FileTooLong \u2014 669 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: DruidPooledPreparedStatement (34-1077). 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledPreparedStatement.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13965ef2344dfb7eef4098299251712109a2112b8183f4c0402edf2cf6e793dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/MySqlLexer.java: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: MySqlLexer (32-987). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adcf57bf020ad3db9bfc7eed3b5b2ba7f667526fdb5622c7c75025c02b0d54a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLAlterTableAddIndex: TooManyMethods \u2014 40 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableAddIndex.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"32af83945a105b1b1cbf95122a4a24af0a7c66726cf37e547697c626edd74667"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLAlterTableAlterIndex: TooManyMethods \u2014 40 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableAlterIndex.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a687e39ff3d9d1402a1da384048b4d7efa5ba9be2002e36e3c7b5561f5079"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLSelect: TooManyMethods \u2014 40 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelect.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a179e426a95f31e0934807d3cf430d923be40faaf62ae2ab3fc82caa9a1085d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLAlterSequenceStatement: TooManyMethods \u2014 39 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterSequenceStatement.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d0e47d264967beab52453fce1ce7120a28b255c4b8b9478c8491a0db743372"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLAlterViewStatement: TooManyMethods \u2014 39 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterViewStatement.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"16795f2072e515d5df47e5dc9205ad618209ade739100e0468b1dd516e35608c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OracleExprParser: TooManyMethods \u2014 39 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e69b1aeb110351dbeaf4a131d8b54c0dacb6f7140c5f3bfa3b7abdded46a3e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SnowflakeStatementParser: TooManyMethods \u2014 39 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3288c4e6d7e90f890c7e0d7f036448f1af878a35ea35c66bfc3288dae9b5a01b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc/CallableStatementProxyImpl.java: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: CallableStatementProxyImpl (30-895). 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":"core/src/main/java/com/alibaba/druid/proxy/jdbc/CallableStatementProxyImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fe44e6ad98b9e74033d660e8a1c36eff1d2228e9449fee0a426581cbd8b776"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLIdentifierExpr: TooManyMethods \u2014 38 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLIdentifierExpr.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77530a100490fbe641e1954df5d315cac4065b0cb45b865e7801c247daaa0b8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateDatabaseStatement: TooManyMethods \u2014 38 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateDatabaseStatement.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02554840def0e72a6811e3b590bcf5c95aca1e2a34a85ef72b688219e1aac89"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLDropTableStatement: TooManyMethods \u2014 38 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDropTableStatement.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de9ca7183e90393eb73e44d23fb428392c132c87f8f74ef48aaa05b39d8ea95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JdbcConnectionStat: TooManyMethods \u2014 38 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/JdbcConnectionStat.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"57712e3e097d7c70ba09cac92935fe53db2e2edcdb6869d8c38a2e017eab7351"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WallTableStatValue: TooManyMethods \u2014 38 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/WallTableStatValue.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d394fef7b7653fdf1cbb7ef9a582d90a0497406d80068b48b404e88c7ec77da4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLDataTypeImpl: TooManyMethods \u2014 37 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"254187ffd96c512a2dbf457a606a2f37ca7ef7023185f193544571b4c8caf995"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MySqlLoadDataInFileStatement: TooManyMethods \u2014 37 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlLoadDataInFileStatement.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b77c87c6d09b5d79e49d2bbbde4fdc1068c2074f7beb2484e4149955f372b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/OdpsExprParser.java: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: OdpsExprParser (39-846). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bde35024e44da556f63c0583aa06ae096e71c863fc892f2f08579552824d6fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLUpdateStatement: TooManyMethods \u2014 36 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8db72b65ff02e0f6cc1b1f9712974ef00824942a5e53e4141b1407fac43357"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Utils: TooManyMethods \u2014 36 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/util/Utils.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f135afdbb34043c5028286f2bac61966148cadc191697d7d6bf842d5fc867a0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logging/LogFilter.java: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: LogFilter (37-974). 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":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91d2e71185f87a38f47a44e5d7f60df351c52085873176ef18089f97fad5e53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/MySqlSelectParser.java: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: MySqlSelectParser (32-886). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04282700aed1d3fc21f4263469120cee440f69d093c6b0c25984798dcfe3e10b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MockDriver: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/mock/MockDriver.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bad6ce1e98ffa6c8e0687b907e7c6bcf0420b39ed944f35272f251f13169a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLOver: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLOver.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f20fe7fd279ade0220550a0d09802a20cbd4c7594f3c062b74a0b5c0bc4a314"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateProcedureStatement: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateProcedureStatement.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fd610bff1a18cc0ab0b8b2f3d8c73247899cb544d99fbfe355885dd877e716"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OraclePartitionSingle: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/OraclePartitionSingle.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68e4adfacd4629ad95dc932a24f48295a930f314b84467b636ec577c5db6966"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OracleCreateTypeStatement: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleCreateTypeStatement.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebbffeff712aead4b99c5b4370dd655c6899a96987500be37d5c0ed02956059"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLServerStatementParser: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ef9249765bdcd570e539d5e7326869b819f8b61cf1a9cab13556ec71d2f3b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TableStat: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/stat/TableStat.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f286d0444054d60f89b6e87afdafa555b69fd79d2ffeb5ef498c5b5a87f06fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WallSqlTableStat: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/wall/WallSqlTableStat.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed29f3652e98d06a0dd0b5ae0d84decb67c206f8eaa4d0617ac9291414ca74b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc/DatabaseMetaDataProxyImpl.java: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: DatabaseMetaDataProxyImpl (23-950). 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":"core/src/main/java/com/alibaba/druid/proxy/jdbc/DatabaseMetaDataProxyImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de04aec03dd371f38823bce7d7e2b136288bc6a80c8f91f872446c8d20937099"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLAggregateExpr: TooManyMethods \u2014 34 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6855a02b3a5d3a8d524353f6478233477e0e88e51be512c1e6da9895b6afbbb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLCreateTriggerStatement: TooManyMethods \u2014 34 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTriggerStatement.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca3929195f060e50b4fe53ef82100896f8f034bd9a96e248c4fe50cf9b8fbb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc/PreparedStatementProxyImpl.java: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PreparedStatementProxyImpl (34-895). 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":"core/src/main/java/com/alibaba/druid/proxy/jdbc/PreparedStatementProxyImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27cb17ac9a5ef82dbc3bff90209264ad4ee57263600a5429d9559ba419db61f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/MySqlSchemaStatVisitor.java: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: MySqlSchemaStatVisitor (37-926). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlSchemaStatVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ede7ebcf683fe623c90b1f18f7d24bff32cfb42d5a0d743bde54039c39c9783"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLTruncateStatement: TooManyMethods \u2014 33 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLTruncateStatement.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a58de4ce44440b15faef466fbb0676e25d1a3b57551635c7c56bf50c0bd0bb2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BigQueryOutputVisitor: TooManyMethods \u2014 33 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a2df9052499426afd1b042333f196b54ad76e3a7db7ac46dbe948ebcf9bc96"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLServerOutputVisitor: TooManyMethods \u2014 33 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed322e363a53ed2c60458a776b0a2d9c477cb69f08ed58c3a08ab652a9d44fdf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLParserUtils: TooManyMethods \u2014 33 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e67432bc6b648158d5702eec3fcfe3e4cfa1c62cce0aee7d0c51d498475a46c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebRequestStat: TooManyMethods \u2014 33 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/http/stat/WebRequestStat.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fc91727368e97169170b3e4017c0bf9bfa1775a2aa6d5a23c7034b78f5f525"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/MySqlASTVisitor.java: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: MySqlASTVisitor (29-1284). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlASTVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"511757d16fab365a2ec55dd724981932b079b8bd951b69c8c6dd0628890fb2d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/DruidPooledStatement.java: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: DruidPooledStatement (32-890). 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0666c34c30a4d79019ab28e518e904b5928110caf60c0b752794b62af6b44df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snowflake/SnowflakeStatementParser.java: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SnowflakeStatementParser (14-839). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"274f1901b543b3f304d5ddd5e3d9ddf61a66a44815040598b7464025cf0dafc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wall/WallProvider.java: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: WallProvider (43-897). 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":"core/src/main/java/com/alibaba/druid/wall/WallProvider.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3edb0914e7a904ead29a1051c1b32b6850537e6e1f1dfbb1bcb014d7b0b39ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLObjectImpl: TooManyMethods \u2014 32 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"30969d3383973bd7c22cb1fab74bdec07d115b86eb1940b57bc6ebfa38d35709"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OdpsStatementParser: TooManyMethods \u2014 32 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89dfa010bf7c7b3fe138f27233d48cbd584fa6fe25be7fc58c8f488c0c27a1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SchemaResolveVisitorFactory: TooManyMethods \u2014 32 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f86a110b0f0983b923824da330d8741f3e4d7048a7787661808b05756a56bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqlMapClientImplWrapper: TooManyMethods \u2014 32 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/support/ibatis/SqlMapClientImplWrapper.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c57610c0ba3429953206d21f57da271b978e0612c0ab4139a6c904b5fc6f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/SQLBinaryOpExpr.java: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SQLBinaryOpExpr (32-906). 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a00c946ca032eb663cf80e7410410c1e837cecc3bd208dd7aa21f37364834a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/SQLServerOutputVisitor.java: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: SQLServerOutputVisitor (37-786). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2ca971e45f106eefbcf75a644e11735a128ce7634983e35d5b2981d7191af5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/PagerUtils.java: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: PagerUtils (35-809). 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":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b97d17bbb97d325a168f56e74e34293c5f1ba5b5dd18e74ced7c53732a94332"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RandomDataSourceSelector: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/ha/selector/RandomDataSourceSelector.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cc8d9f99e912099a63abfe7f73d46a7af596e2b717b46a7bb821db67f0f520"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLAlterMaterializedViewStatement: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterMaterializedViewStatement.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f21a1bd51bd8abc70c630c7dfa389d7885c6d6219f40b83b2ba408a6afacec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLDeleteStatement: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDeleteStatement.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"493030585e44f7415a9147b53e8daf7b6638f930117637d876a1c0e01b03ef49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLInsertInto: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLInsertInto.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"da24c2491b04c21ed8fe72dba3b1a50cde01f5a18210d79172bba395bb3a7b63"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OdpsExprParser: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af9321b65225a405c7b5503f189a0611ef4245f55a041868bf1cbb7bf86689d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/HiveOutputVisitor.java: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: HiveOutputVisitor (43-741). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6ea97fcd18258509c9506429e0c7684b7b7c16d274631d9e0d8e24f64075ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wall/WallConfig.java: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: WallConfig (28-988). 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":"core/src/main/java/com/alibaba/druid/wall/WallConfig.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b932556d3cbc968640fdb77294144b8f5612e852c251650d0f111afb40117b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/PGExprParser.java: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: PGExprParser (37-683). 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":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb121c363b461077ae4c3c88f2f45a2f6e6b6c19256ba74de393afb360bb1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:245-266 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java:271-292 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:245\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2866d3990d028d77cced2d4f129fa954c496f1be1ddc89f5bd187aa56f8425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:256-278 | core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:422-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23b7385d217de3ccc6317807275a3c78e1906b003f6a63fbeae9e1b1424ac40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:98-118 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:266-286 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:98\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e33a6fdeb944590d1c7ed54a4fc82451955af6f261b5f3f5d58744ea68810ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:322-342 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerLexer.java:142-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"be24ef327415681376988b8c5765308cc055a77d7d284a557cc81b1546134eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmLexer.java:118-137 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarLexer.java:164-183 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGLexer.java:168-187 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1769-1788 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmLexer.java:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmLexer.java"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b323e4f55d42ad7d0e0eaf3257e28692665a5dbc09a18af5fedda954f4b6268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:463-482 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:554-573 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2335-2354 | core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java:696-715 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:463\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1072b8a2b48b8dea667c01acba78b3c42ecd5f8236d5e160e701c27bcd48a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:130-149 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1550-1569 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ad94a446ee0e40828c1d022607b7fd148f9bbc3ff846dc5fb01cef76b3fd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarLexer.java:136-155 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGLexer.java:140-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarLexer.java:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarLexer.java"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9387775b6d7b039115dd87927fc8b7a83ad6747e2168ef900d2f951c3951abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:454-472 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:254-272 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:620-638 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1878-1896 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2002-2020 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fd6fae3cd9d4dc186f6797f329310a518e38027b7c60b0f46fb3d66e151618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmLexer.java:159-177 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarLexer.java:224-242 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGLexer.java:228-246 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2356-2375 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmLexer.java:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmLexer.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f21d940335da3d93023faa75bf31ebb45f90f2c26612bbe04d134a54c6c847c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:2633-2651 | core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:2665-2683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:2633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ee0413ec4bb91345cf8fc3533b6ebc6ed52f92de6ef6df90f3719f0f748d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:181-199 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:549-567 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:181\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f21e7e7518f3228a4f44dff366b7388606e4eb3cc9017367585132b3f920a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:232-250 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:598-616 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"60159c13e5ca77dfcf2e7b351b29120478b963f78fdbc2dcdd22d668fc702fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:255-273 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerLexer.java:79-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:255\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6836db7c4160692bf6c2d4826427fe2e27164cce9f2ce41017120bedaf4664c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:398-415 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:157-174 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:525-542 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1836-1853 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1957-1974 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5874a817f55d41d0b3da5003b66a821ae1f4e944232ddfd4075bc4a8db7a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDeleteStatement.java:285-302 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:1529-1546 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java:353-370 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDeleteStatement.java:285\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDeleteStatement.java"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"01db8c435cca386ca2faff6c8bf1f90b5dfc62c54bfed958e458f5df9c2ea1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1463-1480 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1567-1584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1463\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22cdeee29f681cdcad45ef8cab89ce18d676b061f4ea9a71ebd154f512bd3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2148-2165 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2641-2658 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2148\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aed8077624f62ef94e1c17ff76a135a6ec7a75758d00a07f7c34c01fd2e06c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteLexer.java:54-71 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerLexer.java:181-198 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteLexer.java:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteLexer.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a21fad72e15c711cd5994ef6f010d8d2957fa87f16f7858e7c71eba98627039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:380-397 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:420-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:380\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"467f6034cc8cd5ff4edf55132feb5d421bea77096172751cecf0b67a0fd31029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2673-2690 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2808-2825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2673\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2673}}}],"partialFingerprints":{"codehealthFindingId/v1":"427773a2a867a4782444df3cec7385be595e06d2f0187154bbd9f20b0eb9e462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:80-100 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:128-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"222e3888b8c5828df16745018ae16ba16795de54dde05edb965271ab47ef4fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:303-319 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerLexer.java:88-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:303\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a190291da7577f8e2a51db279f0c5c05b473ab01f4658188fce23313f30096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:157-173 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:914-930 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf30f09667019b9bd55d7058135c59fa5873062f286c749ec89dc029944d187a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1786-1802 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1834-1850 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f149bbf482d1fcd8733ec701ac5fd82fd5f1f12019b0d8e236401cd1178127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1608-1624 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1985-2001 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40ad33c37bd937db775e593a1f2df13cc485f8cce88edd0a24974c3532c18ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4455-4471 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7669-7685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4455}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b255995506e6d549870f2f4265c4e423f0c60006c4a59853c9cdfc86cb240d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:911-927 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:990-1006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:911\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4df434a060d017e9d5628c8d6c4a8a417dc93e786f7773e2065a347cf2d598a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:201-216 | core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:368-383 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:127-142 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:495-510 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1806-1821 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java:201\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryLexer.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9576ba870f56c20d8c67b7066bc86bbc0f6f81d9ae9affc276bac7103ae8a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2868-2883 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2918-2933 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2943-2958 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2968-2983 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2868\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac83009b0a758f08159a6da40119a1a70f16f8e6fadf30c5940ce0cb5a65bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java:1551-1566 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java:1575-1590 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java:1599-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java:1551\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLEvalVisitorUtils.java"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b42846158b760fd77db25f54ea331b930ef877feb626a4d872923074ac4091b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:366-381 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:305-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:366\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca486f6fe2cd895ff20317372c70b82a659b9fdf91adcf3da9d9fb86620238ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:398-413 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:333-348 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a6fe9c479437834c8aad3769afb98d94bf121e6a6993d835bacc4b793322d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:295-310 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:412-427 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:295\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"619ade13fbe193ccc6af2f449db449427385f3cfa6b6da80e806bc422befba01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:344-359 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:546-561 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:344\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdcb49c30f9feea4f4d84966cb2a715006a2d41bcc0e2229878b64f01caada7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:608-623 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:985-1000 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:608\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"89305b49bb6b32992b1bb09a1c57c1857ec60e0c6c70e6a59ca6b58d9f3171af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1686-1701 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2076-2091 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1686\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa84889fc9af171f7a4f1d299b6a7660132b85d3e7a3192b2cc6f4755eece84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:192-207 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:199-214 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92c3e6d6c89cbec062fd7ef9c561ec7e9478193927a5ce6c5723d3d2571e6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:666-681 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1204-1219 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:666\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"70910421faf22a228b35124d50f831a2543f43bde6aa09368b1a3253bc7741a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:1002-1017 | core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:1058-1073 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:1002\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"1801c80cf6b2cf11acd7f238dd052c8f341969cdfd011935d374b20c397aeb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:311-326 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:363-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4218bf2ae2e7bc6cb527e3e129ddacdea82eface3c7299681f76ad25de6bd1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCheck.java:78-92 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLColumnCheck.java:77-91 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDefault.java:92-106 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCheck.java:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCheck.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ca843b753150b965947afdc876024be4a8200033340d418c02c82627a6f731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:743-757 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:385-399 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:1571-1585 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd6d871e68b71f2d297e67880290fd5bdb657e1e48b29e11debdb3cbc0d08da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:482-496 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:516-530 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:550-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:482\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6766155bdf91f29e3582224aa6f68c70caa428c670b1eb9f92df7190fa301ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:80-94 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2140-2154 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2633-2647 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:80\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b433e45d8309838983ef05d4142fcb919de4394bd690e84217130fa4e53c6a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2394-2408 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1322-1336 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1699-1713 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f413980c9d2611b884726a8aa371be1d07ac1bea5212eba4952acf0958838e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2485-2499 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1414-1428 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1791-1805 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2485\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbba73ac871a140048980e851bb6eca0023e9adfa6835a72c37a4eac25be4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2684-2698 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1604-1618 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1981-1995 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2684\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ae39dc52b0604cbabf96cce4a428058609bab8fbdbfd050d6e6014e5c98071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:408-422 | core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:442-457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:408\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8a551c5052bedc4398d9f88a07db615fad173858bc1f75a5b0872656b444e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:209-223 | core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:251-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a81b6bf0f298ca34191154029f272191e6710698635312069b5d580881518d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:277-291 | core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2ExprParser.java:158-172 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:277\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae70b821d4c3e17c0c16f4587c7a2fa7b11ad3468efe8361d5a09575c8ee736d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java:78-92 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1524-1538 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2a7c1436bb23072ae50eb6b48812e222b8415289f7b229c21dd245090355a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:225-239 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:279-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"310e595c5714d638911ebfb797356eb570cb44d72258c8d50917a6fae8e1ca4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:186-200 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:815-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:186\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"322a47e7eebbd604eb6bc2b309ee8c4558c6a37c5f36b7235d09e8a40658a856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:206-220 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:831-845 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:206\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca2ac7c3fa4d91a3c5781623c241045fc2d291f14022f29d40c48e8d4999154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:282-296 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerLexer.java:106-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:282\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64e12681a7a51974dae8c19afbd02c18f42b93af1e2061e7502fa4bdb92d00c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:184-198 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:164-178 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:184\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"682d8a6c889341dca77ecb0a703f13c39951e050d862a41a0aec4bb2c01ee0e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:352-366 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:349-363 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a620c7045abaf689b8e8cfc566f1cf993456eb84a4c7ad759951fe36a89f546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2001-2015 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2494-2508 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2001\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad95334f5a4f3810c10757845d9bad034c8131a091077e99ae98bb0283bff6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2333-2347 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7929-7943 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f4127811cd3557ccd60dfcefffbcfa9f85602b6b4c1e720993bbb4818669aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeLexer.java:186-202 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2379-2393 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeLexer.java:186\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeLexer.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c7afd223a77456254c1a06a7c47b0c978fb4bec1a5cc61f77c65e085742db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6338-6352 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6876-6890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e353616a55779e3c4a02c9d47410f9b2f849ee327a21aaf38dec1257218c6028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7523-7537 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7570-7585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7523\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7523}}}],"partialFingerprints":{"codehealthFindingId/v1":"2878cf69f855473f4008217f93bdf9db37c005153f8311a771f0b2f308a1c1c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:2093-2107 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:2120-2134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:2093\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc80fb8a63c43fcae0ec2695c2074420542b373711a9b40afabbdc435466bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:475-488 | core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:506-519 | core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:537-550 \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 \u0060core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:475\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"336b15d45c231582938099540612ebf1324194f866e4ca475b25067934862ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:376-389 | core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:395-408 | core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:414-427 \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 \u0060core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71dba1e7132e89e979d0dbf67eb5f66a9f378b51e0065f8664252a309bc389c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:433-446 | core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:452-465 | core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:471-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:433\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"312ad15b44afa15c23cecf096766bf28fd88ce4424588e6ddfe1df74ebe8bb98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java:241-254 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java:286-299 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/ast/OdpsNewExpr.java:37-50 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"248678665ede560c0b7083b97d82e0db6d5e53cc3184326ea58bee91c7464752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:272-285 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:410-426 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:612-628 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:272\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba4450d3b98b0be663729162f9029fbf2f2e851d370934628cf91166409bedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:59-72 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:82-95 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:84-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9d0aaf6f265a5c25ab5eb4dd1efbc14318c3a141eec40c47b1f9e7513e1013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:503-516 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:771-784 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1151-1164 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:503\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd02a76b59c09c637ac3a59b51e6f01357af04e72d1d46e5d4ce5eb3a7b818f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1685-1698 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1726-1739 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2116-2129 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1685\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fc268580ce257801f5564408d1399c983fd222ae7cde49c70a12dc888dd59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2526-2539 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1456-1469 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1833-1846 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de0dc01709f9f70145866b0a67893b8ebbae6b951c249f04fcd5ca042c0cefb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:1191-1204 | core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:1220-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:1191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07c8fe25fdbbdc8d7c972a8aec3e1b4f936618b9aeb7463e9f771b5d0b0f87b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:431-444 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:475-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:431\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c914ef280aa26f722110f618e056582462053c76cebcf7d73a9da2a3e20c56b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:539-552 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:557-570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:539\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1738a30e730c98651dd211bf3ab5833f5a8b5adf34b789b3d883a54e0879f0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:824-837 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:937-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:824\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"947cb1d4054371f977ab014c2943e27aacf5f644cb785f22940268e44e29f6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnique.java:178-191 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlTableIndex.java:123-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnique.java:178\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnique.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1182f04a3f3a6b6dcff25fb316f0038ada54d61169a6227b27b5f1549403c7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:331-344 | core/src/main/java/com/alibaba/druid/sql/dialect/hologres/visitor/HologresOutputVisitor.java:41-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aba28e03202e67b83b0640aa114d9b20cf32d6038c5923ffc6a511d365c669f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:84-97 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:136-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:84\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59dd8272b3e6c5d9d89d38a1a541d3f890543f200da0877781b2970893285ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:256-269 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:360-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1dea80c146aa7cd5a9ac387937ed07c1d0f342e5a969295711aeeada9a4615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:200-213 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:223-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:200\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69ba18993679fa4891620f9d86c05582964efe63ee2900c6f176b2f50ca6d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4264-4277 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4337-4350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4264\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"385ac9aa37b45644f1f98583a3b28f6e7722604af2507b18398e1122c4ba8a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8396-8409 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:73-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2641ce840431cbdcc3bd4b45d96c28296acafa3d2be0c33bbb27ddc5a1f1fb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1371-1384 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1720-1733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1371\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc3c81a385abba4c649d9e269e1ab99b2106b139f4ef0a5623c50de85c4623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1810-1823 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1874-1887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1810\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f03c00844cb5384a2c0fe36b02d8008c312bfd5a585469ea0e3ba8139c3605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3998-4011 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10987-11000 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3998\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3998}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad55a1d30ba0fe8784c79d36fa3871c108974d2d381933f2d483348bb10beb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:378-391 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:375-388 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:378\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b16ccce545bf311b8ae0b0b97a5548729e442af3ae4a8f1a109153960eddad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:556-569 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java:516-529 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:556\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"616366e597ff74684ed6d470a1133d1b065226608a0663bba8f3707a3625c282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:794-807 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1174-1187 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:794\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4ff51da1cf5c6ddd2fbe1fd41714f20503b14f082e647190b274974aa7e908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1238-1251 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1618-1631 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1238\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67b71971bccdc60620937ce3a1739a69e73efe966b84556f77967d56cf726c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2284-2297 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2777-2790 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d404edbeb63076712b56bc7ea88220cd925ac507b88e1746dae4f4457f35f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2592-2605 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2728-2741 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2592\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e0edfe8071cc7944bd1344005fa996cb7dc8b5cdb16fde70820371b5852e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2879-2892 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2920-2933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2879\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"26894b7d470ec34c326c6e1cdc19174bae4ac849a80c92d185ee1739c85b6cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:740-753 | core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:906-919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:740\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d917e1cfca644e66f457dc725122b001a85443a1af03a60dee240e6056f8acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:245-258 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:269-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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddb2492d251d027694d774a472202ac06aefb0322b9669045065a7c13c9572b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:586-599 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:646-659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:586\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f523eec0fc3961bdb54acb985e7b394f0beec9f4f733dbeaac98bbd4579c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:448-461 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:543-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:448\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce5184aeac9a8838544b6a0d1d29c0137e8c272becc8030d9b999a05a02cce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1690-1703 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1710-1724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1690\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66fa6cff5027673e0746923a46c8967968d36816f153b0fb3527ee15313bc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11233-11246 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11259-11272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11233\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11233}}}],"partialFingerprints":{"codehealthFindingId/v1":"73523d0b42e34922cbcbdc973058297c5bf571cc348e2c7e03a201c78945f7ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:12025-12038 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:12053-12067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:12025\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":12025}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc0f2f59111273f7fa38f7b1cf13207adbf0311333bd184d7f53719bc61089c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 8): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3429-3441 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3452-3464 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3475-3487 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3498-3510 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3521-3533 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3667-3679 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3712-3724 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3735-3747 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3429\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d3aa59c3290b63efd1701e052db6e3886830e9ffe3682f9ecd86d0a4855488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:234-246 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:372-384 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:369-381 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java:162-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c6e139c9bfd1d04241ac18885e880f600ec529fea5e4f4b70907b8f7cabb71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:1000-1012 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:1077-1089 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2465-2477 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2529-2541 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:1000\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25ff1169e612826c54e1cbfd28530cabc7ed2ba3314353eb8bd7dd2a5553cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1903-1915 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2396-2408 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:12194-12207 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:12233-12246 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1903\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"f544ed3e8f379785f7cc47ca6fa54ce0f62bf854a0d2b86388cc089f0be970d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java:52-64 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:180-192 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:52-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ac6374364b0814369541975822dcc25c978fede2f4ff1e4ec1bf40f682d667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:241-253 | core/src/main/java/com/alibaba/druid/sql/dialect/hologres/visitor/HologresOutputVisitor.java:63-75 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7231-7243 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38b18c77dffe705835e6be774336743b3dd169f795243a6d8c7696d224bb9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmCreateTableParser.java:40-52 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarCreateTableParser.java:38-50 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:88-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmCreateTableParser.java:40\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmCreateTableParser.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce69cc9b505d3bbe7e82c04a6dea484b4c7f35883dba7c351fa7c9df3f691ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:197-209 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:269-282 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:464-477 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:197\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8cbf3954ced0081ae70cac557d3c9f9962965f00a24663d29485663edcddb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:167-181 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:196-208 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:189-201 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9fa54ddc0aa3ba0c176901ca40abc20f3800704b6045924590061c9c13a780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:202-214 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:227-239 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:232-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d6e2d8bb1ed17f0826bc399e90e18cae8089c46e0360ae5111642fd194aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:287-299 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:606-618 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1136-1148 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:287\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"669baf74394d74690e66ab292f315e11f08e0d383523c3fbadc6b65dc103cf3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java:135-147 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:183-195 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:190-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"25660177abeca2a4b4e452e6cbbd54b35969be3c5d2235096a00ef030cce3848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java:165-177 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:725-737 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11502-11514 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce098029b3f3f035bcc81157d76ff12f84d7e8496a3dbcbb1baa7e870c47d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:123-135 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:568-580 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:232-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfd1a3b26fd1f99f892ebc7b9e1d647a366ccd7620cd85cbf680f6e907d627b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2797-2809 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2815-2827 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2832-2844 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2797\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02bdb2fb11ffb5d5063c6b2f8524e9118a03cef3ff8e9466a080dd697e3cdcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1604-1616 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7181-7193 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10249-10261 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1604\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b69ba424c7bd78240ee2c05408892f483c34e8cfdd84ac06406b83bac40dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5709-5721 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2984-2996 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8123-8135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5709\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9b1aac5804922b2611e3b5f9b8ab5f1d53595d28881d6957a2d911f525a3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1345-1357 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1368-1380 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1391-1403 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1345\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"7996875bd0a2cc791d24b81db1c51e45b3988427e9585c2817156a486b9e4f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:687-699 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2084-2096 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2577-2589 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:687\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea25887c1b9ec50394ba8f1c153780649e1a64abcaa83aecffd1af15abe89837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:975-987 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1097-1109 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1477-1489 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:975\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be4ecadb1c6e97c751555a217e9de6365d6b77577bba606eee16f41af24c429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1642-1654 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1689-1701 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2079-2091 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1642\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a79a69e7a77596a3243f3c66508b4d29ddc5511a6faf06ff127c1757937e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2606-2618 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1528-1540 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1905-1917 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2606}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e44994090dd5bcef931febb2e71355d9abef8cfdf8b7aa3e1b4521b7a7843bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:1329-1341 | core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:1383-1396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:1329\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe0b620d5019d8524aa64d36b82dd3b8d96f599d203a8c6aeae4519dd2f2f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:1360-1373 | core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:1415-1427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:1360\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c8983d571d95634d3fcfafb4ee38990c0e91e6bd091b3187db97a4043b7f2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:603-618 | core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:638-650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java:603\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/pool/DruidPooledConnection.java"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"31edf19bb13f8921108992f7f36f77322d7af8490134a3ef77f0b5fe51880b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java:136-148 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLInListExpr.java:180-192 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c1f23d25720d9789736baa114d4d559c776b9438e6f38e743a759a68f7cf86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateTimeExpr.java:116-128 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimeExpr.java:128-140 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateTimeExpr.java:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateTimeExpr.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc34dfb717a202dcbd3eebf897b1e4ea4ed314c158fb1d1406cdcea4d362428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterSequenceStatement.java:59-71 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateSequenceStatement.java:78-90 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterSequenceStatement.java:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterSequenceStatement.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aae884fc251f339e00d700b227c3a076d9f158d069a2ddcf9f2df9105bd32ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:932-944 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1141-1153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:932\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"51503aa063b549d364b9bb8eba055a726c5c795044a2149726c393c7298fc86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:288-300 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:2066-2078 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d18e44fb991f5c684d8c4ccd4d98930028c9c7722f77829e34ec02a100221c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:404-416 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7730-7742 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:404\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c64be550318f19e87d30c09a97c4f3845623b846b48d1530ef92111b0abdf6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:95-107 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:333-345 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:95\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68232ad228e832ed304ba20b21dde5620d4a1c898e5a0bc5bc961785c8e4f85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:168-180 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:220-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"84632c43b4b04f0a04fc8076411d88445b40f12032f8c84df0d6117c821ca139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java:88-100 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:225-237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.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. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c485ce31228c4797bd87421b697f47b84cd145a4a39e2a495fdb56fb1031f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:343-355 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3767-3779 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:343\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a89d416c94e2d9ae202a0ddd74ba3509544ba01d9174dff48cd496a4b8fab6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:372-384 | core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java:266-278 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:372\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124439f931048f50978897cbc84f24862d7647c66d3ced815be222baf224cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:236-248 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:76-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:236\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c453908b416826b2fc6623935ca286531d5c21b010bc09803c758e62959361d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:369-381 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8488-8500 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:369\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f6a99fdae5bc2e868f6ccf431432ee1aa75d4743a60051d8fbaf50a7ecc57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:463-475 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:757-769 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:463\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa0a8bf2ef15a3cafc3c70efc4e97b626fee2196c918c47980ee7f8e91cf55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:821-833 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java:310-323 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:821\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac2368750ef52e95821981f5bf3facaefbecba2457b4de3261d63997899c8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:950-962 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7543-7555 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:950\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"94de06ccbea3508b0ccfa1eeb87a7c7f0b18b21ae3c24f45760e015c02f9fc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1154-1167 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6006-6018 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"23697464c9b8d3e4b6d27142a8a1493b39900abc71647d3c24d5c8c88dd96e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:682-694 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:716-728 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:682\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fce81da826f3b2f1105cc9cee5d0ddd72dace5eebc0110e9b741865f202cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:993-1005 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1031-1043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:993\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e5304704eb8feed7ffc7924307f6bd668a06686852b236794ac68f8d995eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1099-1111 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1174-1186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1099\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac6961165971cf6990fe380b810b0fddd285ab57870c4de21735d37171ed441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5270-5282 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:5089-5101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5270}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fb79138b0fa93fa32b4789f3d3e579afc3b97b35902abe1c236101d434562f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5608-5620 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5691-5703 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd1d8089a0a21dc6ffb17de2bc284772dbb8b16c70019eeb86391c4da1dbfc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1690-1702 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3422-3434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1690\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afe7dab366e7a5550b6ffb9588bc3cd01d8e309d74ae2dd106eda790a16a2da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1792-1804 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1828-1840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1792\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"51439a8b2e1f8bc61b7fee17ef0cbc2e8d55a6cbc54392bac9b549c5a49afa3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1188-1200 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1225-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7e671723450d3bd58d76928340c2e3aa84bd35e6e7f69098f1859030fdfb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1498-1510 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1970-1982 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1498\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa83f5157f76b84580ad33ef2189baa19c8947cfedc3f6efa6a76eefce499ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:219-231 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:468-480 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6307b52042faab0326414de46501a4d78c7865ebada52a1fa9ccf1590181db7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:564-576 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:911-923 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb40217c7b6ea97ee005775a6493d69f6aa23b1278d3a9ead81a5df8b5cb7c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:1076-1088 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6691-6703 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb9a91defb1b45e7a196f5a52168eeca374ac60d07ab26bfc8e50c444b83bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1421-1433 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1525-1537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1421\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8ecbff7bde2a0a0cdd68c72427779b759e000b1b8a6bb469e10429bde807f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:969-981 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2434-2446 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:969\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf83500cd255337fdc749f73c3631bd142efcc698e61916598cf28e5e74cc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2781-2793 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7448-7460 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2781\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"29be2dfbec14c1c6acbfbef2681b8895cef5c0206d26a932a67ef5f9863348f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:278-290 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:312-324 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:278\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5149c24cedcff0caacff743cf1c25526477e3e8a990f4f1350711eb5f49760a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:230-242 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:210-222 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4008947acd70d9874c65a059b5641de5b6181645f5f7dfc2fef5601c5165c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:305-317 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:310-322 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fd99a37cab4b377dc23891ea432c832eb769652a580645846df1c67724ab73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:464-476 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:743-755 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:464\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9738284563025ce6b8cbd26c52e8055da94f65c0e8e9ebbf5a02113a3ec604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:575-587 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:952-964 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d99f1eeb9eca4066e3420f9985cdf03788bbc4273b4c95d70ffa9bc21984c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:898-910 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1278-1290 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:898\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e580ef13e3a0e52deae551a86083c5754a51d5df1bddd1de1da764efcb37f4e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1021-1033 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1401-1413 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1021\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3076c4ee92917155982659b5a7a756f3953e6ebf070d1426d4f55feb1766d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1582-1594 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1959-1971 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1582\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"adecb0b4b1dd6c2cda6819a1e2654afb06b94e037931984774c0b7fed94c03ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1859-1871 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2249-2261 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1859\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3471777ddf6a7f95fd8bfdc994b77576cdb798222b6b2d1ef20e2a1b8fbf3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:112-124 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:114-126 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2ee050bdf57ca9a6a4318b1b0c01361b699ab8747d1acfdae0a78c5a03755d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/phoenix/parser/PhoenixStatementParser.java:64-76 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:120-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/phoenix/parser/PhoenixStatementParser.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/phoenix/parser/PhoenixStatementParser.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9356c13bdd2f8ce2f68fb3bab16575c744841877ab280cc27a85453db88861c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:639-651 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9838-9850 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:639\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb0f0a3796b5f54ae6bcb1221bf46e59050f405c915f8e4da1d78baddca9db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2521-2533 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2571-2583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"394e570ec8562391085e79f60af77ff7260d9495b3c78ac131a4681e334e8848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4156-4168 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4207-4219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4156}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aa413e548f82f8ef857b6f0993454ff7a08e01624158381521a767696631dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1573-1585 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:2013-2025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1573\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c9ead4332fe03f98d4f12fe0b6b6f38e6335666719775d8ce122635473d2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:3885-3897 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6981-6993 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:3885\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3902018f0fa9998c143d7caab230f120a48ad49f5d68275fcbcee45617d437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4414-4428 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7653-7665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4414\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b63fab8c7b0b6ec5d40a1cd504abff1a95c6239858f55fd6342d165e1e07d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6089-6101 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6699-6711 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6089\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6089}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe5255ab35ce6d63491f9e746ce1b277bcc628dc96d5130dfe1c649e5a01298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6374-6386 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6912-6924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6374\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fce0836a2cbfaf4f9d78d00caca153824b93597ca6b7dab8e7851ed087ab330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7029-7041 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7107-7119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7029\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7029}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5f0e9b63ac9a8392bbc7dbeaa87cfb6d3012d0e4a57650fdc2a622e9bf64e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:2439-2451 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:4265-4277 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:2439\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a339bf8545d09fd83bc3ea6c4cecd3d91c28e4342f13092701ab2b1f179152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5522-5534 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5597-5609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5522\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d447cb375d694cf01df217b3160183caa65c2721d3ad8c7549cd598787593479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8796-8808 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8905-8917 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8796\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8796}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f122530541ad496607795226dd35564db0e95fd50e87bf94877389269bb9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11551-11563 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11595-11607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11551\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a409d1c5bb7780f17fc8cc6298ae52a4ece0eb7b2178d11fb0643bfef8231d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1070-1081 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1096-1107 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1121-1132 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1146-1157 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1171-1182 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1196-1207 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1070\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e71328620d398f4021b5c74ed5d51b9c99a5be42e814ab18a941769ba42859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lcase.java:32-43 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Length.java:32-43 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Ltrim.java:29-40 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Reverse.java:29-40 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Trim.java:29-40 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Ucase.java:32-43 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lcase.java:32\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lcase.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8875d5862c1be596f885eb3b3fe3b46de4d6e83fbfa5015873b2c6e5264954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:72-83 | core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:96-107 | core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:118-129 | core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:142-153 | core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:166-177 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:72\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c1f04a71ca2d85573c3f46c69c84187166336cfcfc6dbc51c6f12b8ad660ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3049-3060 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3074-3087 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3173-3184 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3238-3249 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3381-3393 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3049\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"466f8f76f68d2c0f2683c82fd5edd3bc75c865e27998629a68aebd79f1880466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:110-121 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:564-575 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:911-922 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3408-3419 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3472-3483 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2702a81eb45860c86ca5d3dd1da3bbba1c188643f57cba9606011ae9cc1eeda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1179-1190 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1201-1212 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1249-1260 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1273-1284 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1288-1299 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8870e5ce4221205aac82edde98316b95c586cf7945f2b0f2525d4f1673356583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:89-100 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:190-201 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1179-1190 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1500-1511 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:89\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d76ffb66e11d4bcefa6983f7627da6de2374b8f0a321daf95528d987dab8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:565-576 | core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:633-646 | core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:656-667 \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 \u0060core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:633\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"6108f544b7a195c2dd71790a68875f684c8d0c49ade9490ecf78b2fd2df38cb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:202-213 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:225-236 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:248-259 \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 \u0060core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:202\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ee13c05e59aa5db5873d3655683368aae1f1b5916217b1ac2dcfff35a29414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:341-352 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:364-375 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:387-398 \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 \u0060core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:341\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"612fcac50ad22c98e1e177a68dcffbc0c1cd78c7a83bf10d4d1a27b4d32e45ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAnyExpr.java:104-115 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLQueryExpr.java:109-120 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLSomeExpr.java:100-111 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAnyExpr.java:104\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAnyExpr.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7120c4ca7a4bc1838feb504a15ee2b8d464f41152991e18e035c12e6535542"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:175-187 | core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:244-255 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:477-488 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:175\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbd6a66b4251d67091ada9467f772f67760cdae05f28e76d34b76d0943dcef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:282-293 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1228-1239 | core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:144-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:282\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c51b45991e5b77c5561e61a604937435104388b5f9ff746322ad5cca86e557e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:463-474 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2695-2706 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2830-2841 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:463\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e62086c67828615f4733b60b116eb28c07d6c9a1b77d717e6e5e9a90171bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3405-3416 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4012-4023 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7846-7857 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3405\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":3405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e664b3e04ab4f4a504de40de30b442146fd04b3583ffeb84596443ee55d4565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5355-5366 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5423-5434 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5467-5478 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5355\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed050f04ed2c0bc1f66c4ca219ffdfaafa8f07854bf193afd93e126cb6e1db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5631-5642 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2946-2957 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8088-8099 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5631\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcff24a964dfede9481f82cb573982c3b76001320682c99c9d8d3caf64e6088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:293-304 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2020-2031 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2513-2524 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:293\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"559a6d5d05aec671865b3e6eefa74683931293ac6b44234927e780484e9d3f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:528-539 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1858-1869 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2248-2259 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffc2acfdafc042db4543936c8c1971ea68022ece363c777f84e908161f2a450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:566-577 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1923-1934 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2416-2427 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:566\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31492cd57a137dd8ac1e4168bee14552e26747b78740d5f86bc2da78eab50dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:823-834 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:919-930 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1299-1310 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:823\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b79bd3b71ddacc1e3c5b570f7c9cc7233d395de93657763b5cfec8dffb8f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:871-882 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:967-978 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1347-1358 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:871\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ec3f86404282b62718f8a5e4e894124a625731adecca8a2e22ee77a93ec9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:887-898 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:983-994 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1363-1374 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:887\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b82eab7f5a531255fa00b0ddc2c030018d839b3051cf36b339b5120963ddb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:930-941 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1052-1063 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1432-1443 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:930\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"161db6c2107767c5a76cf5caa2a88621b5563b83fba2f31342bd27027926cbb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1096-1107 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9648-9659 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9665-9676 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1096\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe95040f9d8160b4349832d38dc4f941c5c4312ba5c543d805fac091c231ea48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1493-1504 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2246-2257 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2739-2750 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a79f939559360e79c27bf96c27b90fe03e37b59ca11bed2b62cb8779a14aa2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2629-2640 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1551-1562 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1928-1939 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2629\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe643909372db93575bc689eb56a03cc30c1c8e152a40af10a9112b75b907c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2726-2737 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1638-1649 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2015-2026 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2726\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3f7c29d4da9625b93b1b1a241cfb0ed2d534bc28e5585036760a23d85a46ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2764-2775 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2182-2193 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2675-2686 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2764\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de37d89ef0d22f344f18c88fdeb50219b7fa0d7a7a004f469d456e8d1802910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:248-259 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:310-321 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:362-373 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:248\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f29f2afb97fd721999b7593cf468b3d743d7d3c835efcd6975f1f50225bf048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/ha/HighAvailableDataSource.java:267-278 | core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java:1221-1232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/ha/HighAvailableDataSource.java:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/ha/HighAvailableDataSource.java"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9762cce1080cbf5235a760dd94946de665a4f9e22de78830233c96368aeda9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:681-692 | core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:819-830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java:681\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidPooledStatement.java"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0878163d5b5ae10d52635346e7f445b58dee3967475b70e6057b990200883322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java:181-192 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/ast/OdpsNewExpr.java:35-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java:181\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5352a8e27a575cbd1f75483d336bfe2eae6ff875029e04cecb38e84c075b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java:369-380 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java:402-413 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java:369\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"124a349d2f8c21abc9f567204c97b9965c8202ee49a7c55f64505ed712367b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAliasedExpr.java:94-105 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLTableSourceImpl.java:66-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAliasedExpr.java:94\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAliasedExpr.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc1001c291d3762461e463d8ee8176e12494d8c67e857a6d97816f802ce1938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLCaseExpr.java:179-190 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLCaseStatement.java:154-165 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLCaseExpr.java:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLCaseExpr.java"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"17186ebbcf4d46153034c79ad1159328f83530cebda673160ff6585a12876f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLExtractExpr.java:106-117 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLIntervalExpr.java:120-131 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLExtractExpr.java:106\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLExtractExpr.java"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad62c0945a597cb3c0e858937fcfe40585be27a604a06ba17b1145281499d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateDatabaseStatement.java:251-262 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLDropDatabaseStatement.java:120-131 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateDatabaseStatement.java:251\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateDatabaseStatement.java"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabf077fdbb81314dd2c1c4cf10afb5fe7a06a6bc337cf68029e00cf5d9d8496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:762-773 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSelectQueryBlock.java:263-274 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:762\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8cfd3a0df6a8931837f4167d7bfe2d98e66bee43ef4876022c1010f93eca5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:792-803 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSelectQueryBlock.java:295-306 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:792\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0078526d90a461c0dd297c8de7d47265e47a735a4a4a48654c719de5d77542d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:222-233 | core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:270-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb9d2bff6c6db7e20fd003cbbd0e99131b1d1715ff0725618241e5b734fe5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java:72-83 | core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java:113-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.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. 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":"core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5b595f3a8dcfeb415d4bfceeff395681c7290e7fd34fe2244ee4d2a41d62f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java:137-148 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:114-125 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9a43a08b7f751a5c1a8dc9a6f1027cae68f4d36840a86f1515afe8bd33c173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKExprParser.java:161-173 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4637-4648 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKExprParser.java:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKExprParser.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a873511ee7ae3e72d030af4627bd9e80becd8cf753eb647c17f64aef97cd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java:80-91 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:493-504 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"169bdadf1a4314fb1cac0297a6bfde11c77fa5ef8e1b63267bacd2b9bf8f06b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:127-138 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:428-439 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:127\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"033faf73f068f25d1ffe806dcdbb7ff31586c7b5ce2a9b4d74926bb34d9956a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:74-85 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:92-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"903a2c44d3f8475dafe86be72dc3a3d414816c9daca437fa23999034342a79b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java:138-149 | core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java:237-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b443fda39146796ff3a5c60845a76fb38ace441b1de4681240fe5f1794ee427f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:160-171 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2287-2298 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:160\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da5948ef114b47a1337e052cb99ee56f11eff2aa238d3da5eed4c1ca46ad192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:421-432 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:3085-3096 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:421\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa1d3145ddbd8456fa110a307245769f2ef06a3e1a429f47025388d10813078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:460-471 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10694-10705 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:460\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"95530cad6150117880de5f4ba5a98bc975a823ce295ecffc51b0918d439ffe76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:87-98 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:791-802 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28b630f31a77d6a642cad21ac0a9b2b040c6254a5d2153991da3bd175e8bef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:350-361 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleLexer.java:293-304 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java:350\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveLexer.java"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22dca41642db7e166a6202f9c8bd3f2b1956258a23f3c2b485b9d188e4b7a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hologres/parser/HologresCreateTableParser.java:34-45 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:46-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hologres/parser/HologresCreateTableParser.java:34\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hologres/parser/HologresCreateTableParser.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c952bcb58cba9cd9d90a818fb7feef13421699784dde848a99eff06ce3638d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:229-240 | core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java:211-222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:229\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8692edb8afdbc87b5ecc16b62162bc2d47de3c8d1aa6191c3e025cc0d82d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1223-1234 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:137-148 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1223\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b086238774d2c24b856eef42d44681e577ed38ebf07dcbdd6290e18e610774f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:790-802 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:278-289 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:790\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc70f3372a52adf9ba5e86005beb4fb054b48150e49695299355d6cb2df1345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:963-974 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:987-998 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:963\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84972267d48549c419bfed45f725e3e8874ccb2d1cec5bf32799570f52dd152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5850-5861 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5877-5888 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5850\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc387f21ae6051f83992069c404813518400681dc506f019dde22e183b3328a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8231-8242 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8314-8325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8231\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b25cd35ff9c1e899c5575d3b14ab338cd3ef53c39cf66dea90e3be1340fd65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:371-382 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8828-8839 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"739135dd7bfa43721dd029ff51a7687bca89abbf320503982ab46a6ff2d9c62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:611-622 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6290-6301 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:611\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"99660086d22e760b02c2aa7dacf802635822d3732803e01a222e8329cf379830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4368-4379 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9152-9163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4368\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4368}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a74a00658217166fadb21c1a0d0a9245c16f128051a1f9f8982f5f084cbb45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4944-4955 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5190-5201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4944}}}],"partialFingerprints":{"codehealthFindingId/v1":"7785eba20c402178ae2e993881a7e4811a4298f89ed6387516c3da1c9da6f61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5326-5337 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3827-3838 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5326\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5326}}}],"partialFingerprints":{"codehealthFindingId/v1":"450861039d29c5cca3adf600349af566b8502d07e7f82f9eeceeb9829dd9cf04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:332-343 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:2895-2906 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d9323e8fc8796967316bdecf84c084088ea2a0a2dfc48e40eaabf8ef48b7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:652-663 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6737-6748 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:652\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9633e8e221c7b3e93fb3d511ce221d7063b62c73234768bfe8503d7cc6b56c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java:567-578 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java:614-625 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java:567\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"76da1a925dc36276cb2edbe7ae30a7fdf7fcb917120987b083af914451ba8e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:909-920 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:932-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:909\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a16f4152e7ecdbf2644b8160224bb8b053681926babd338d333fe49cf9d516e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:718-729 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:737-748 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:718\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"386e952543b987cf4674bf0c28f0ff33f50e3d3a34fab82e7ca043be262fab41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1503-1514 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1537-1548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"241446b044374f18dcf48e6c4f2000fcfd7dc1294fa769a9a3d696625d1b09f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2257-2268 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:871-882 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2257\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd9d48edb9d6ad381517bf19342f9aec160734fa20690e470b64199881152f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2560-2571 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4858-4869 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2560\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"5056420ff3cbb219816a37b15925514377026783596254ffb8e277076f5eea4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:237-248 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:424-435 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3d6a00c1966ee3c43281ff225de5ddb061358b2cdc8008be642594994bc437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:167-178 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:160-171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1196eb5b798242089a54e6773c7a58c499de80e8b7ff04940f2c4d878fda221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:213-224 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:193-204 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"951ef8e52f35b8f16c72be07916000225c8d98ef18f719d06c603b83eb46ea34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:535-546 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:908-919 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:535\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85cdfa634659e2c4a0ceea1d057f2e0ac93e382e6566f63c53304f3e926fc9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1152-1163 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1532-1543 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1152\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"011998124db84a1c38227a417c06fae68978d9d3df1e373f3f68999b47dd17cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1205-1216 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1583-1594 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1205\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0a27af3112adafab56a9579980107deac3eb3ba2d5388ceb8bb25144ab1120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1376-1387 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1753-1764 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"828be552b60fde1fbb3248835eb61edc3be0671117c939ef65bdb5437104e145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:233-244 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:288-299 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e757699a6dd68938f31b4ba43e9d28a5b0f8c0ac59abc5a18525323d55af86b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:321-332 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:446-457 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bd971f359d30eaf1597e79d78f01f9006efdd34b801cf21ddbdedadc70e07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/redshift/parser/RedshiftCreateTableParser.java:27-38 | core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java:48-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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/parser/RedshiftCreateTableParser.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f91da8f34b6a0643bf4780703bc9e603407d85d626af9dad4e390a3a6aba3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:209-220 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:6526-6537 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:209\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e80eba8a2beb3489a5ad815eb4fca4b438b6f24f2ed33756916db0060b6063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkStatementParser.java:75-86 | core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkStatementParser.java:104-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkStatementParser.java:75\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkStatementParser.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfb17934692811affaf29e67bb9c6ebaecb9756ad9add78348edc81be331bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2570-2582 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2600-2611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2570\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd084213e57b9db2dc93e058148d853e6a56c5935d01d517380489ea5188317e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4990-5001 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5034-5045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4990\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4990}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc281f607bb22c211360cd283a5d7eecd5910ec780e7306674e7841aa657e8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:789-800 | core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:971-982 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:789\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f832289c0433d1e386f5dee85f61dc5b1f60688a23dd9b44658b5eb77e76eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6942-6953 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7056-7067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6942\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6942}}}],"partialFingerprints":{"codehealthFindingId/v1":"284f1a417add9292eb2af3e0fcf798a10524432fc4e4b4e5e23f064c6df68289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7196-7207 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7230-7241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7196\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff541070c9ec45d239767f5d911346c6507618d53a267b32c1886ab17d5142d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1102-1113 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1195-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1fa37b01c77596fea3c3b12e8ab3e93951ee6d9204a531e2a7f586a124e319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Ascii.java:33-44 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/OneParamFunctions.java:39-50 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Ascii.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fd33c14043077b3a4f2199602f22be64d00af1c873bdbefddbbb15eba38f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Bin.java:29-40 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/BitLength.java:29-40 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/functions/Bin.java:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Bin.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"568debb00f8b6c0286ea29efc8e197dff69e78a272ed6c8218585663c314f562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lpad.java:33-44 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Rpad.java:37-48 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lpad.java:33\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lpad.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a92bba2c8effe8e93128caa7744dd64eb318c3d59a86e0a05942fdda78ab693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:1686-1697 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:1754-1765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:1686\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bba14a21b078a2b8fa00f3decd755a2acf177815b7db80d09dc8ea31da9c986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5557-5568 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5644-5655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5557\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5557}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e0b185dd8090ac11d7ce20ce56aa7e0242fb40e622eb643ca888b1e7f8c484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6288-6299 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6953-6964 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f76bb6434cf5d3e369a098cc0b1960e56207ed74885e7023b58042d058311eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9421-9432 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10531-10542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9421}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaaa583b496d8a2a9b30cc99a49c2942fe7456862954dd954d0dd5ab710d1db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 13): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3006-3016 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3423-3433 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3446-3456 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3469-3479 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3492-3502 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3515-3525 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3594-3604 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3637-3647 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3661-3671 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3706-3716 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3729-3739 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3757-3767 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4030-4040 \u2014 all 13 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c984ad0207558f7641d8dbe855949dbd6b136ac5705d84710ad0c889ad0aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 13): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1657-1667 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2778-2788 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2800-2810 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2920-2930 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2950-2960 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3213-3223 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3235-3245 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3257-3267 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3279-3289 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3301-3311 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3352-3362 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3374-3384 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3404-3414 \u2014 all 13 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1657\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50eaebd85efeeb6e7d28f0949ece39e295d6877e7357c4c507c5bbd18b90ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:187-197 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:210-220 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:233-243 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:256-266 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:304-314 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:326-336 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:349-359 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:372-382 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:395-405 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:187\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d11ddf7822a807de563a13353d5d38bf429af70d44d5e40dc281f0abecaf21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1835-1845 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1854-1864 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1886-1896 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1781-1791 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1800-1810 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1819-1829 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2171-2181 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2190-2200 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2209-2219 \u2014 there are 9 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 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1835\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb20b719f5362acb6070d5008c9ebc6cd9350cfd058adc4e1ae840e9f3d120d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java:160-170 | core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java:185-195 | core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java:260-270 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:216-226 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbCreateTableParser.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ac6aa2052b47c46a2ef1f6aeef8aa54a00b5f81833b773e24d4771d506dfae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateMaterializedViewStatement.java:442-452 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1580-1590 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1620-1630 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateMaterializedViewStatement.java:442\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateMaterializedViewStatement.java"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"867cb59702422cad16efecfce002f4cd3e8fd59ca71756d5ac367a22ffb34deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/SQLPartitionSingle.java:112-122 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/MysqlPartitionSingle.java:86-96 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/OraclePartitionSingle.java:184-194 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/SQLPartitionSingle.java:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLPartitionSingle.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0bc267c71e3cff8ba04199af1d6369d3a79b73947943f087d813e6925d39ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java:44-54 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:115-125 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java:51-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa7a5a0bade115175dfd296f0791f164bfd37241ed5ce5969ec07089eb05445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/blink/vsitor/BlinkOutputVisitor.java:60-70 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:722-732 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3952-3962 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/blink/vsitor/BlinkOutputVisitor.java:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/blink/vsitor/BlinkOutputVisitor.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1760f19b5cb3548ff15af9a4ab4277ae5ea89f1786c0079e6ccad3e74f514af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:31-41 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:51-61 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:51-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee3dc6fef2e7a76d58303e49b780cd1b98a1888a2ff78527b1dc2eb2150eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:50-60 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:70-80 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:69-79 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21533c9ebbb00b47b1c59d59dff50242a4a30a58fb6640d6faf2895481d5ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:107-117 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:136-146 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:138-148 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d858a52c558ad3f770c844f29d532871c7f10d1a9c15f636c9d212011772c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisCreateTableParser.java:53-63 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:228-238 | core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java:210-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisCreateTableParser.java:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisCreateTableParser.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e9519268139dc4cdd32b53c223b47b7f4c74bed8adc0a9faf60cc5062eea0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:405-415 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java:332-342 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:2382-2392 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e3426487cde99117f87515202ae41c3e0880bee454f7efbe35f5796587d793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MysqlCreateFullTextCharFilterStatement.java:72-82 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MysqlCreateFullTextTokenFilterStatement.java:71-81 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MysqlCreateFullTextTokenizerStatement.java:80-90 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MysqlCreateFullTextCharFilterStatement.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. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MysqlCreateFullTextCharFilterStatement.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb9ca7f397f7c5bfb0d0a4bb46107c86ea14d6f5260a6e20bd6c8a61c07236c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1181-1191 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1220-1230 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:134-144 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1181\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2bce643eb27d046bd5e7b34bfd8b029d5b85849a8783dd161626a64882e826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:774-784 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:798-808 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:822-832 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:774\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2996d9d4c4999773392022bca8e3ed3c8698b82cfcadd0be72c9bc167c933e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6442-6452 | core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkStatementParser.java:73-85 | core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkStatementParser.java:102-114 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":6442}}}],"partialFingerprints":{"codehealthFindingId/v1":"abadd8e4c5096e1608f406ab7dbaa7f19d87401408c44161c447ed77cc9e8a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:548-558 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:308-318 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:503-513 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:548\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8454a50094157c28341e989811ed9b9b98afacddcc41e28d00644ac0b758c930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:260-270 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1993-2003 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2486-2496 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d142966722478f2a79f1024cac7857e0317ddd26742395bf8869bfc4035fe3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:610-620 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1967-1977 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2460-2470 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:610\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374a01c533f03236ebf96397329aecd75f10ab8a6381e11a7bee47a151172ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1015-1025 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1137-1147 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1517-1527 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1015\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc07c3226a0de9c5241efd491dec6fec7e7688593210f85a4b0da8e29687a5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1039-1049 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1161-1171 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1541-1551 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1039\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b79f07f58bdd3a38881692c3a5d7f3e2384d3c64efb5c6686b524a587d59c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2506-2516 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1436-1446 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1813-1823 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2506\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"50551d58056dd1cdab8b6ee39193a4b1357d23aca457b3a3e071f884243c6b11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2573-2583 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1495-1505 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1872-1882 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2573\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c8f154b9f4aa2f8d6c037f3de150d826ae47f5c86cb6da03aeadbe40b89c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:3950-3960 | core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:3992-4002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:3950\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":3950}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b0c076b0c0d8432791fc8f02dcc492667e817b6e5041be26c468e63a54fc3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:3971-3981 | core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:4013-4023 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:3971\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a6ca59247c992ec159b5abe4655d5402a950523c0dec81ec1548f4e2f90de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/PreparedStatementPool.java:119-129 | core/src/main/java/com/alibaba/druid/pool/PreparedStatementPool.java:150-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/PreparedStatementPool.java:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/PreparedStatementPool.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81059b033f8a2c6bb72623c6730d24c5713c1bd67b43037d9ccba4f87860465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java:344-354 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java:357-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java:344\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLBinaryOpExpr.java"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c739b6bd31dab1a2a8667fbfde321a41c9ba8c2f039028fe12eeaf85959450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:100-110 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java:84-94 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7761879e85de775ceb8f8c512688f39c52d233c204a354beafc8e70c9e16397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:121-131 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java:105-115 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eae467cbadb1de3c063186091001ad04d21d2659bbc4830f5837a1cbe85577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:142-152 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java:126-136 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b4691f6b037474479ae663983cd082fccb3331c609b3b59b3e4aa519eff80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterViewStatement.java:237-247 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateViewStatement.java:283-293 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterViewStatement.java"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2ee9b63afa11a7288135a426cfeca023773211125b94bdbb94ec936b297e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterViewStatement.java:253-263 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateViewStatement.java:396-406 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterViewStatement.java"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f4d0396c05070ff4f6d46cb396080e4b560d3d50725c4d4f45d8d67b064a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:156-166 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:229-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c431509c9639f9b975245a4e1b4aa7aa868dacd04ef5cfd43770b9cdc7a9da8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:744-754 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlSelectQueryBlock.java:252-262 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:744\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22acdf8ef061bc1dfe144524eb488fe110412eace108e7b32b8d7b593b76e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/SQLPivot.java:60-70 | core/src/main/java/com/alibaba/druid/sql/ast/SQLUnpivot.java:59-69 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/SQLPivot.java:60\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLPivot.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf399a3d1247efb0a8212a628c33a10891e52ca8c00e156bd18d94bba99f736b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:492-502 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9877-9889 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:492\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe4f53dc5c35f284c0af9dbd56b39fa4500250941dfcdeda2ffdfe71f0545d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:316-326 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:2751-2761 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:316\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c9e72b6a80e323e421fe6f7c035db9a8ff93c3b4f84878e2c735bc5b45cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:107-117 | core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:237-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"333fe2479f73d39b3e8a2143be3dcb223f128061c73c756a5a1356ef230e0f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:329-339 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:152-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:329\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d166af2f4d2783441600ad25abb14a7d7f20f244227f95a878f02fab9998ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:277-287 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:394-404 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:277\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d012edd0427d760e14a6f6526ea34433f5bfb59de4c7da24350e3ff046af7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/impala/visitor/ImpalaOutputVisitor.java:99-109 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3801-3811 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/impala/visitor/ImpalaOutputVisitor.java:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/visitor/ImpalaOutputVisitor.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"13beba6e23e1053229688ecd8e92a1cf8dc847938e467a2eb16eab6f7b7bdba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java:370-380 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java:418-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java:370\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bca7a7127be099843239c23ef81c36c739dbe8cae03e824a0105636f084fe4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java:390-400 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java:440-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateTableStatement.java"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47d04707c9a2c401359a2b5aae5d358c4f9cb53954265c10f032d6b8a658acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:304-315 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:325-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:304\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0aaf07c69336d64c512e7abb0bab9999a00e773f140df10c14318581f76601"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:770-780 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:787-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:770\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80ae19fe308a109ddd9a5cba57bdab9186ea24dcf1cc0823b3d9dc49da7d770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1049-1059 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1291-1301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1049\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6202234ddae54f3e052479e2c6254afe1ce1c8ae681e9a6ae647fa6117658e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1475-1485 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1494-1504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1475\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"afebe0023df797561dac39387a8f9b94821c92aaa1e775aa5345fc3c5fd909fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:426-436 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2624-2634 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c27ad89257aa1cd6b54b2c866d01469e47f941e148d5a6c69d9fc5fbc3a84bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java:75-85 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:67-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java:75\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac40349238939965891bfd8428a3bb7c5f4153ac896295007995d44e447fecce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java:289-299 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:821-831 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java:289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c72e7cb8a75e2b6fed39dc199e7a9233d03182b0e73779bc23091a2754a4c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java:303-313 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:835-845 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java:303\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectIntoParser.java"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ab4690f4ac4ce5302f5505d8372d702a337189fe394b97264e4b951b1cfa09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:634-644 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:950-960 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:634\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bf8295e7647750b220fa9ee0edca1c95a8907d5738884950aa83a8db6907eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3307-3317 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3327-3337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":3307}}}],"partialFingerprints":{"codehealthFindingId/v1":"075179c0c2d5db8b3d2dca25bddb76fc948de51f8d8015b6af02afbf38d4b8e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3819-3829 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3846-3856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3819\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3be86b420a83e94bda5005e530570360e5b9e47abab9a591782ae94c346d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5129-5139 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5153-5164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5129\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3ed33143edf40defd990ab7d9b7a27c673b98ccf9cfd96b2b2142327ec961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5412-5422 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5456-5466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5412\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9e0c0858c5d54026f34f0f17c019fca9782623d48af3a853c725de5f7528f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5518-5528 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5558-5568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5518\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4837faffbb0d56e07a63218e9ea81bd12545e2b013db7af74176a108e06288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:9410-9420 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:532-542 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":9410}}}],"partialFingerprints":{"codehealthFindingId/v1":"4920dfb0ff0ebdeb033cb5c188be9911833768d3a8115ebc181c1d28119709b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1408-1418 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1408\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d52e8f5c78d9e103738063faa6432b5ef470888f8336049c18d25b1bb17bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1580-1590 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9243-9253 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2c8773c2e45cef41608d6269a1d79dbf6126a2c277ac6d1b123994a6bc55cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2225-2235 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3876-3886 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bde026a2aaff46c01531d6287e3f37234382bdc1b04593ee3e46ad2094d102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2576-2586 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11411-11421 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5432dffaae0b1405d84b0c525b0a8303e0dcc0cffc4a58b7f88b9fa2737482b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4679-4690 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6766-6776 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4679\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4679}}}],"partialFingerprints":{"codehealthFindingId/v1":"3265263a21036c36d96a05b18bfa24aec005ce94ade05757d89ca73220db84c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java:79-90 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java:394-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55e984e3e17fd34d9d305dafb714b35677eea0ae4285483ddfd2e7abc55c393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:464-474 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:481-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:464\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"815520abc2734361f6ad3b427fc243b6a0d1e86cd2f83c46575454030ade04a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:1146-1156 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:2202-2212 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:1146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe8f252ae9c874df91e9aff1e0d3c21cbdba8a5b436fc134cb242b4b621ba26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1390-1400 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1491-1501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1390\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ef7c96d319b967a89a84d8dae1b66e0bec469297cf73c51000a5a9bc760289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:1039-1049 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2492-2502 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:1039\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a17c60a28b93a8f0c0096751fcbc8db518ad8728b2ebe459c6821619b0d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:351-361 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1190-1200 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffb7aa0a4e089111296260ccb391a4d4899b5df70480a27f1f7ae2d6bbafe8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:377-387 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1628-1638 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:377\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29272b4ddb56140e15b2997cc087f9ad97ddea650bb837c8e7e67d29e74e530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:215-225 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:293-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6c65e4cdd9c39e9e07e6abbc783d36f9caa2b19569df98f1bff6ef72b64b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:453-463 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:491-501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:453\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b6e26870b56c1c29831902fb593a35d0eb1fab332c5158cc8439da095c3336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarFunctionTableSource.java:60-70 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/ast/stmt/PGFunctionTableSource.java:60-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarFunctionTableSource.java:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarFunctionTableSource.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfaf964e7de4e7109d16885d99521b864167a3377f41d89b20f03a7c8e646b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:77-87 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:92-102 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:77\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bba880c7ddcfcb9b59e6a0547b69813941cb451799cc6ef34719f5cb93e5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:842-852 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1222-1232 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:842\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb01463c5109b1c97abd8785c8523db3dbd2a166df39e3948fec3a28bf37620b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1742-1752 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2132-2142 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1742\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"214be9a279fff390b19f808ed889749017bdc0e49aea80534303af2bc936194c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:493-503 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1013-1023 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:493\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc1dc4f40b94398c2bdda92ed30e452a17a79b1508c85dd68ee083d159b1575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:575-585 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1104-1114 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"db948301bc8e00e0dc8697542e5aa4d07c9c84b6f6023eb23f7db6c65cfc84e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1249-1260 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1338-1348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e345c588a2c9b7fc5a0c4209c0692f42749f80d2703597f22414e955bd9337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/redshift/visitor/RedshiftOutputVisitor.java:160-170 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3700-3710 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/redshift/visitor/RedshiftOutputVisitor.java:160\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/visitor/RedshiftOutputVisitor.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e2209a029677610b98b8b1aa6b758f310bf858985d2e74b6a97a88cdf2efdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java:226-236 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java:243-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. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c027135ef988bf3ee017741133eb239b6f819abc541710579c88ad7e10f298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:609-619 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:633-643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f7135323c2a6c4de800ffd95c5958cf2e2b9c276812a39f895c6adb5644459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2165-2175 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2185-2195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"421c845eab9a5e21a7ed9188e733372a774c7dea58de69b393c01f478f82d707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4137-4147 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4189-4199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4407d58a535f310bd07bbfb4824cd825bd3abc4a7e0d7dab349e3f83e62a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4440-4450 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4474-4484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4440\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7687989018f45d902f0a9e09c725b5b5ae57b0df26352b14432d556382a0db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:2668-2678 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:2696-2706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b6b7d38b8337caa62bea04c4f65e83a614b3b081ad24e27e9aa1f6b1e83e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4371-4381 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7613-7623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dc9091342af992ebf7ef06ca478c5e6aeac470baeec322718744a9af694c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6157-6167 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6438-6448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae72c13afdb9bac7fe72f673c3a230288e3746e9c6d6a00627ed4d84da9e6fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1581-1591 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1849-1859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1581\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a9d32dab1f3a5ee594e2ca225ae24e0da8f900f221b22cfcfc7be6b2820d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5277-5288 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6749-6759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5277\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec9dc795450951d2b0bf0d8f56d252bd54dc8aee85a9187f9a086600fbb8eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8635-8645 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8657-8667 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c99e1679fc6ab37c099d5d556f582589491a014669a5d8c0e60426553a39304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9341-9351 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9488-9498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:9341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":9341}}}],"partialFingerprints":{"codehealthFindingId/v1":"002063a323117d276c90073b6e2b4ce5ee17b465cec4a50d7973bc23d2eaed3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1461-1470 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2214-2223 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2707-2716 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7756-7765 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7781-7790 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1461\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f9fff5391a776cee69e02423d3635c3a0817a9616b580992d9dc280fe2ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:77-86 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:98-107 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:119-128 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:140-149 \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 \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b31ceb5f5ab2ecceb106633a2f438167d50ad6eb1cb56278d15e0e71119461c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:568-577 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:741-750 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:772-781 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:811-820 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"42075e5e65d8a242ab152eda55e52b90c7210554afd9ec07b82682bac0781d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6735-6744 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6754-6763 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6773-6782 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6819-6828 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6735\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6735}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb69c765dfd78523cb1bd12f107d690aacc526b25035f5603d63778c403629f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLLoopStatement.java:81-90 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleExitStatement.java:73-82 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OraclePipeRowStatement.java:56-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLLoopStatement.java:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLLoopStatement.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8de1e4a951c508aaafb369ed590ca87452899b012f6b6c3403f45d888915c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:145-154 | core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:221-230 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:454-463 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java:145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2StatementParser.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72075c7521ac25e28be7fbe755b98497cd73ffb6f6f2d0cbb3b1066b6045242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmCreateTableParser.java:54-63 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarCreateTableParser.java:57-66 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:107-116 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmCreateTableParser.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"082676d5db49d35664603b465b120f8b76e41ce62b657a0c81958f171065c15f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:226-235 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:302-311 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:323-332 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0c775b2a14d4ff91115a819bdf7037d44701071f9999fa32268cab40179676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3545-3554 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:973-982 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:405-414 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":3545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad4846828291723bcd063f14ff2efe7d98d586f75e8704d68ad68f1ae5edd59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6388-6397 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6403-6412 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6418-6431 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6388\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":6388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f32d856233a648cef21ef9c91f07fd03914759ffba413452a04d6b75af22f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleCheck.java:87-96 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleForeignKey.java:89-98 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleUnique.java:86-95 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleCheck.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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleCheck.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c5d873f9fac441ed8903cf739e4fc175456a221d622ebcba30bc47121b7b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:178-187 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:824-833 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1204-1213 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bfcbb2a6ff1f9019f83a1d6da5b23b6e4c82609f140083ac1ed65f8dec9d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:188-197 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:834-843 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1214-1223 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"042c3be98c16ff7414b250adfb0f37b2fabfc52c1ef8564e5e69d4227685867d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2442-2451 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1371-1380 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1748-1757 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2442\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcecf6759281c4c33a47372f389753b11a8d79ef55eb72c9c2fe289514322ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:302-311 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:428-437 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:3581-3590 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"398159180aeb080c43a5d98398fb8c36e1ea8d27b431ddce389996ec5e63543e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:288-297 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:376-385 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:406-415 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:288\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e913eba22772eac545ce371fdc182c90e7c675891530097d42b3aab509554727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1772-1781 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1813-1822 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1839-1848 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1772\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef3a51c9b8bab4d4edaf6f7a2aa2bb687fdfc099944a74a000bc7da12cadae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6139-6148 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6158-6167 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6439-6448 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6139}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ffa287f72a4cecb185ad2805899fe124c0b74b5fe8c50e97bbe876d95f51bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6425-6434 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6443-6452 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6460-6469 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6425\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a3a4ec42727974a443d0eb460734fc2ab6016ae223a0fa2a137c6d8061d816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7132-7141 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7196-7205 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7230-7239 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":7132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa177ddc466820faf6e38e0746890a12aac12c6917e186aa777ef8801b59364c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java:1979-1988 | core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java:1994-2003 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java:1979\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf46ede6b28bebbded431ce5a265ae82addbd3e75cca44981a1c6d0782e851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java:46-55 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLInListExpr.java:60-69 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d94cda9e1e4e49e7e61ea6280faf8e4feea2b219868aa7a2ba737b6e787db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java:107-116 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLPropertyExpr.java:109-118 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90cec7d094def6f449359df2a162eb2a7587b9f53d16ab0ec3f825567840658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLNumberExpr.java:137-146 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLNumberExpr.java:150-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. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLNumberExpr.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac3b5ad43b35f767b9cea729a69431f46150ef93fb05128db14bc1239bd38bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:99-108 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java:99-108 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1e8046c65e3380ac5daae62beb90eb0198c3f038ba9b806568563442f54a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCharacterDataType.java:135-144 | core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:364-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCharacterDataType.java:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCharacterDataType.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb618ee8df545ca3f29acb9a4574a315e0241e74b0fd9215693c48f8d44931e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLLateralViewTableSource.java:129-138 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLValuesTableSource.java:99-108 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLLateralViewTableSource.java:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLLateralViewTableSource.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8685720dc10bbd62572e446a3632c0f53439de2f3c5126e1814739f3ba90b465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSubqueryTableSource.java:97-106 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleSelectSubqueryTableSource.java:84-93 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSubqueryTableSource.java:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSubqueryTableSource.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ab4e54d770f53911daba6ef68f53497678b481cc068b8a5a3f44e07e88f925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:325-334 | core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:373-382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:325\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cba59b34ea211450f3a5e0a66acffe54a728bf1b8427315032e8fe302f899ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:337-346 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:2118-2127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c4d3468bb969f8504c3981935f6ddb1f9d63c9acfa6f9844a6ec4c1300805f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java:121-130 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:213-222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/blink/parser/BlinkCreateTableParser.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"377b163acf4664af51447c3fbee32d68396497633a977c52d52a81e6b7e526c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKStatementParser.java:182-191 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:575-584 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKStatementParser.java:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKStatementParser.java"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d194272d6adcccd2fb88624de77d17f9c8508e60461278022427fdb1558a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:173-182 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:765-774 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:173\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2882d6cfc3091bf1abbebd7a17b06277c1d9cb1f8ec49b28dfbc7831781face2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:189-198 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1288-1297 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ac132143cd352eb13bb916fa9bae2169ca8f7fedbaeca445e30410acc12141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:52-61 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:74-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"900e225165b1aa248fb6845f25accefaec7f83c8f01d223498b8b2d3e36e94e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java:90-99 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:144-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a929cd31488ac780058420c85b80dad3e7bed3f2415deebfe0f5badf53ce8dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java:157-166 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4862-4871 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java:157\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbStatementParser.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c92b6de19888e102cbcba5c6874163d8a379d2d5a6aecb39e55a301b93da141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:292-301 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:93-102 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6466632f2a9f30e851729de2961370343d02d88c416a2bbb5829fbce7d78ca12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:345-354 | core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:235-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java: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. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e17372152082ac1b257b806a9245b23c9084eb817095ac921b5a5782c676eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:172-181 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:248-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9903a380306b0ad7c58db83abb2e8729a4dafa621aaf4b7e1e5dee7efe3f15e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:703-712 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:713-722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:703\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9422b03a38c77e7e5785ab524f8bbbe873711ceff75c165d8160e5fb12cd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:857-866 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:871-880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0b3fa54bea661295b202e300459b7f601ef6a8f9ce71f5be1a5fe4bd8986a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2359-2368 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2450-2459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5118227fc4659c888a4fbd4e478c28a1750d9100e084d139e3a0a9ac37958a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2371-2380 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2462-2471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2371\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"009fc5e970c33fde348eb512166426f746cab211e6ae58deb5f940faad7981cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:376-386 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:394-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:376\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bb01165c8979a5dacacca3b744e817dc00fccd543088bd5475c1ff66f4b72e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:418-427 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:433-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:418\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"610f2644f49b56177e1193e3324c3a312dc88fa41c46775726a82b2936a2d8d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1809-1818 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1831-1840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1809\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"871648f8cdb5acca7f211e58c434796f7e2615e30392a7491011f457eda69326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4086-4095 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4121-4130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4086\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4086}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6df6b681ba21df93f9de471e0aad55ece19cd32e30fe2074eb237006502a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5309-5318 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:5134-5143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5309\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab95761726217478b2c86097b95043fd73d9f89a26f69fe4d3ede6dfaff6baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:9329-9338 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:9343-9352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":9329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67e17d3f9a6df08a184a764a2318b902211908b155c47ab117960f766022eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:586-595 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6936-6945 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:586\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"946d0f8cead1051557f400ed6c7f23d28ee0b8dc55f24e7642f7047d180864f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1016-1025 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1104-1113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1016\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"819618ef166e43cd4ad070d8cb5b4c15240f62396d8e60e2bf841b1f76e4ea40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1031-1040 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1125-1134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1031\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"021697063e165aa84cbe35a05d98c1b45e379e30b952d1977df4eb1fd582dc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1676-1686 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2561-2570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1676\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a4dfdf83664db0f445a23205a3a3209268d81620c45fa8c04c5abab1f9a120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2635-2644 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2882-2891 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2635\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad53b1af87281e267556736652ba48f95f7398214e23946ee1a1ac5bb29a1426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3611-3620 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarPermissionOutputVisitor.java:66-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3611\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3611}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39833af6b2c877b8c2a539ca795d14be225ff6a76e50a184073134cac24400f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4245-4254 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4262-4271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4245\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4245}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4cf9e5cc5e7a02bf030e959668f3249e0f409096023dc06ab43f2306801b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4337-4346 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7799-7810 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4337\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7510baac123280c53e81b986ea829ef72de53f24e734e26ab7599aa07e78e75f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5099-5108 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5266-5275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5099}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fb85db036eab663aaf6e6ace05eb7899a31a67b83b4d84181282e22e692f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5121-5130 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:5270-5279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":5121}}}],"partialFingerprints":{"codehealthFindingId/v1":"16843a05d78eb08e3d717692ddc578ed63fb4538cbf2c2a48cb6174c1032b0dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java:227-236 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2702-2711 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java:227\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc94b4dab943ad447cf5509ff96375f4c691064b95becd1ef75374a969859c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1357-1366 | core/src/main/java/com/alibaba/druid/sql/dialect/redshift/parser/RedshiftExprParser.java:122-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1357\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a585e74cfc458a5cbce4818fc0df04ebfd7460cdf67f094ec5c1fed2ecc5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1637-1646 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1652-1661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1637\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df006992b2ec901cfe0b328d739b7e3718cfd422fc6ab668de0618824684bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:436-445 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:455-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c981e21b5c336e25f8b3c4ba40234600dd184f53a069b3502dfd31ef4293bf44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:972-981 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:800-810 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:972\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"4337bb75bd803ebe44c66bf8384846cefa0e724bc3f4631c7c5ae32b440dbd48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1009-1018 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2813-2822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1009\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc9c33493ffda640d31599a7be5989e2bf34c0966430097c2c9160776f9cb1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1080-1089 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2865-2874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1080\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd24144cd0bda4dc0a411f6550f99dbef521374db9aa66ef67cad7d0a147eea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2817-2826 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3170-3179 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e60d6641e410265babdcdbd98e0345712d34ab17b4d6e860335dc3517b26a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:157-166 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:229-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0f6d8e7f321ce5908453db52dd10f344f1bc8f9cab5a2ae038c28b4b3355c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:119-128 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:299-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ee26292cfea329d9e11e47b91cade3c7bd8c23dc12a0edef650ed006fbe3e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:261-270 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:295-304 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:261\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82fb8da6401ef8a67383ebf3de9dd480f3226f88114899043580ed3c3cb2cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:111-120 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:131-140 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50e43b4e86e952b6d6c69eb087e5697766cc0ef17c859dc1e57ab90d313147b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:509-518 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java:282-291 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:509\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"422f887209ab17df84fb1e0fc0e719c73d7ad12681133db6714bc8976dbbe437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:954-963 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1334-1343 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:954\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d1488e71f3bbfa981244c8163054a36e54335d06d01615fa268f04da8b7a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarPermissionOutputVisitor.java:60-69 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3173-3182 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarPermissionOutputVisitor.java:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarPermissionOutputVisitor.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab9a56244365c45f8cc6071f9feefcbb67e90a4576955986e855f5c3f633757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:525-534 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1045-1054 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:525\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ba6bfea961bfbbe9ae4968858a2ea84f5063d0dd40dfe832eb26c1384f38c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeCreateTableParser.java:98-111 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:703-712 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeCreateTableParser.java:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeCreateTableParser.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bda610c2c3551f2887c727ef99a40ec10726eb62d97f101dfbd35aa0fb75503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:175-184 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:6492-6501 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b0a905c41a688b36a6f415f87008adf39005f52742a386ce386c05644ce48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:787-796 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:864-873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:787\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"56771eb3b9964fa8e6bc968e425b01efa840489a56300264ef2a9359ed5c2d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java:262-271 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3545-3554 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb46cf6a79ae2f19bf412ed70f2e9dae00623bceea9da6062ac6d3bb20729e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:3398-3407 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:3413-3422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:3398\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"87470cafb3f7adc26369fa3ba8e6b0d8cad3045e6c2643f1a737bf5fc7ee909c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:873-882 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:1340-1349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:873\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d071877c2b08b38ce34c3a534827f4c3be88ac97ae0edc36bfb1fe1d542cd1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:1432-1441 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:1492-1502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:1432\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f0b53e9d9958eae51f5af009899be7610c13d20e74ef9265def8a76ce50cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3258-3267 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3364-3373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3258\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c990a920199fb4660687bf782c6127534a35b9ce903bc4a711884785ce7229b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3551-3560 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3655-3664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3551\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3551}}}],"partialFingerprints":{"codehealthFindingId/v1":"145d8e7e34b3296a0482e60a82bca3fd7697229d0a5b3cb36c755157d726151c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5520-5529 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5543-5552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5520\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5520}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cc57b398875daecc8b6e8922df3f324efd32581a3eac570666ceccce6fd2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:293-302 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java: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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:293\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab64a729737378af9c1c2b0ed064ee4ba51f21062145a5837476fa5354a7a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:582-591 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:628-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:582\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a81a22c3b8c367dad939b260c40ad9310ff7c5e7a5d3429ce835ca12fbfa48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1229-1238 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:3641-3650 \u2014 both copies are in the same file, so extract the block 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf23ce858b5430f57b776480f3fac2d98de42a79d7809a706b00bf8349b747ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1785-1794 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1858-1867 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1785\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"220c0f04961d3cdbb922235f79bf05e9ded716f958d8b65ca9c030f19d9e1bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1873-1882 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1896-1905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1873\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e1313e69b734cfc2f95c8d62d3dca2205c9feb5e30aefa0aefdcff161bb33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:548-557 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:608-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java:548\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaRepository.java"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"34941a04bdf91a25c014e3be8364cfc830a6459088ee830e6b36ebd4bdbcfd50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/functions/DateAdd.java:33-42 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/ToChar.java:34-43 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/DateAdd.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b0dc9d30aa9992dc0b7a184fb9a62ce7dbdf87c48e0390f7762b76ebe18165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java:204-213 | core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java:337-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97d412a7477574856b159532fd40b4d268d9bc5cbcdef4690397bb11c731b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:4951-4961 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5036-5045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:4951\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4951}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9d7d07997adc25db804be3accb7e7fb6a208542b184dd766fcb539d012d586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:4990-4999 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5032-5041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:4990\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":4990}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2c5c0820df95b1467aa603eeeb9588e9ce77f8a58a9d6020ffc611cfd1446e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6048-6057 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6075-6084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6048}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4c1b753031ce4041b6237a6822c4a32e680a50c77c927372703935f98166b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6262-6271 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6888-6897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6888\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":6262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba36836166e66091dc1ed35e46271964c11e193c7a360cfe3e98e7cce8ba0449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/athena/visitor/AthenaOutputVisitor.java:22-30 | core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:113-127 | core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:34-48 | core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java:104-116 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:4023-4037 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/athena/visitor/AthenaOutputVisitor.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc0284cb2c5b7583612a88eccb8c7ec955a37c87b260984a0460b5a7a6afbc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java:167-176 | core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java:186-194 | core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java:212-220 | core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java:230-239 \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 \u0060core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java:167\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd05628fd9466bff0966e2dca8842b24de3270f47c54d11e505a7d2cffb875c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2819-2828 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3177-3185 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3242-3250 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3385-3394 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2819\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b10fac608768686905f096aebca4542c8cbd748e7a9d50154dee8686a12124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:82-90 | core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:94-102 | core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:121-129 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cd060ceeedabdf9cdb150ce5f570a932167a74bc5bcce16943fe105b81b620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:226-234 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:396-405 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:598-607 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java:226\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmExprParser.java"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2c797026e65ad283c501a3dad46927cb78d570bd7089945102240148f7d9f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:137-145 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:332-340 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:457-465 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"669b26ca96e6fd33f65ccf884b6833fffc4810fc012af81d4621f40ce2c828aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1475-1492 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:248-256 | core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:66-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1475\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f738ac3f186d920fd80a7f6bacee569d173159c57977b3d0f172d44122db08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:480-488 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1863-1871 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2253-2261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:480\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a42df1ed3cedadc88088d248fc6db25c8c075b1a004c6c1e50a4af7197255f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1053-1061 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1175-1183 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1555-1563 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1053\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"70015e97ec3a9780c96dfc5461c41b29655c84209f58546b1d74898896549cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2431-2439 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1359-1367 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1736-1744 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2431\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50ce265e6d828d6de5fa5a4d828b7cdad3ce434afea04c6f10b544871715627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2594-2602 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1516-1524 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1893-1901 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2594\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"559ef59a24648b5a46a1e81bedc29c6820a00b2211ac4740cc044ec9abae1500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Instr.java:29-37 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Left.java:30-38 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Right.java:30-38 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/functions/Instr.java:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Instr.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ec0134eed68007538d1ec5c3f212473a69da49a29bdf0ad4fadd50da4a9f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:2155-2163 | core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:2215-2223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java:2155\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"987951e71ce11b7f63c9a89bcbf5ce0566449510eac33cb982d69b83a944cdc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:438-447 | core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:490-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java:438\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/filter/FilterEventAdapter.java"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f9d556093602419ea61448ca9f379a992bc575de7ddff590a251fe467d5c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:216-224 | core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:236-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2e9e67b4841aacfee4276279a1010ce01d6d0392e27394a00bf6154bb0859e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java:289-297 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampNTZExpr.java:315-323 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLDateExpr.java"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fede6f475525f9353e34932e0242e2d3f3c9daf4cdcb2512bd85f99746df0b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLGeneratedTableSource.java:40-48 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnnestTableSource.java:112-121 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLGeneratedTableSource.java:40\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLGeneratedTableSource.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df80a895716bf8f0665a1efa89c8751da78f3533b19dfb97d803b934f414830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnique.java:160-168 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlTableIndex.java:105-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnique.java:160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnique.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b443895a2756f2f2390f76e493898f9674951d6a0d692815379194fdfd251024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:213-221 | core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:259-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8df48d02bed5bbd3726f499a2bda74be62081ea11b21ab9cf7ac6754a07cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java:85-94 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java:90-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/athena/parser/AthenaCreateTableParser.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d23d7a5809de1eaf7626f0ae10e0d7b235be261de25a8a0a55aeaafabe91f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryStatementParser.java:331-339 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:563-574 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryStatementParser.java:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryStatementParser.java"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9666998dcc05d938fdb5dc67a718c9e0e67d937570501151844142edae12d45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java:227-235 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:1261-1269 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f7f8b19640e1a17babdd6683bbe1a51027abc4391a9ace262baa428c6947f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:192-200 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:223-231 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java:192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmSelectParser.java"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2c35b5ec06ed6ce3231a9beef0d8f47e9a5e99d257d43bfec2c54a6601244f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:234-242 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:467-475 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"60da738dfcc0a4bc53b134881cbf88d68c70003f64cbe61c95277a41204f5512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisCreateTableParser.java:21-29 | core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java:179-187 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisCreateTableParser.java:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/parser/DorisCreateTableParser.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70b433875b371083084dff7bf1672f4a30af8ce606256f9a16b9eeaf9b6deea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java:113-121 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11134-11142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf529d344b499cc246eefd6dcbc3c3e1a0251aefc9dea76d7fafa11ad9e8d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:386-394 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1254-1262 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:386\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cc2b214b20a35e6cedcbfe6b03b451c00a2b8574dccc5a5976c3404b643b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2ExprParser.java:77-85 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerExprParser.java:224-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2ExprParser.java:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2ExprParser.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd8592e9417fca92bcabd75b64596dded8588ba5b38851d0bec9eee51615eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:255-263 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:77-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:255\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb6c27d07fffa8eeea7dfda39f9262705d2b46859882765c962232a214309ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:106-114 | core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:217-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ac1fc097539de41a41d20ae5a4c0b48284652ca7adef8b8ae9ddedfc75151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlAlterEventStatement.java:42-50 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlCreateEventStatement.java:142-150 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlAlterEventStatement.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"07293485e7e34a69d0a9661d6a9f990cb7d191961bc76890a9e93cfbc7dee5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:341-349 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:368-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b5c14cc334b702b61022ce23fc0a43f71d75aa7090e7637825c8afa6b4ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:635-643 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:656-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:635\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92965d2e2003d390572144c07a680593a478e8bfdbfd3dd07fd1d6d06a1d0fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1362-1370 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1395-1403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"009521a2e44a954962bae63401a19ba2e613d56f6b2f3bd01b43ef1bad6bf938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1760-1768 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1850-1858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c389c123eda5d35be7e9a2faec25b7251ce0de23f354c1c144e7f718e617bdff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2320-2328 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2411-2419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1532583521d69035c6fc0d71633e8bb67e97f469cf4c3bf045bd931a4c7295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1093-1101 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1293-1301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1093\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3f3073f50e39a3daedd052ca884d35658289966185f8697395b6bd03f73c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1831-1839 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1874-1882 \u2014 both copies are in the same file, so extract the block 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ecf3e89cc5fcd8129681aa00e46e7bef60f25a0bc63e6a044350fb50f69657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2981-2989 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3088-3096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:2981\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e455ca9075d86a79add78441a3ed4f80d2ad42e15f7ba57209b75bde8efafee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5813-5821 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5916-5924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5813}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c29a404d18887d5b2313c94caf670a8181bb6ec9d094595663a7f4ff28bec38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7677-7685 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:1024-1032 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7677}}}],"partialFingerprints":{"codehealthFindingId/v1":"3758d1e23ff39f4255239a57f11a5ef2206dc293e9796d8f49b0c1636e5d43e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8459-8467 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:194-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8459\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8459}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd189de7137be6204b21695a15de3cbff5b5d1c46aa03ecfa7011a6c76515853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8649-8657 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1349-1357 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8649\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bb699792318cc1da7371ee940ce143fd2615a49a8e914330812452b188a287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1048-1056 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2279-2287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1048\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"3294540533aee94664879c24e3e26a460eff3e435b586b8ff81081d2aa0a5e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2409-2417 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2441-2449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2409\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78f8693cb90afdc185a1476ea3437de1fce0401f4cf41473bcea449d70fd1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2427-2435 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2745-2755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2427\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"718b691eef972f5c86993e53c48756dfecd691a183d6dfbe1409478a7d8c0663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3570-3578 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3674-3682 \u2014 both copies are in the same file, so extract the block 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3570}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda56fcb14b92a943939da813c1a59ebb281ebd60e2897b8c7fa7b3dc4553c99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3694-3702 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3711-3719 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3694\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3694}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae231bad24e5026ab2128f0916cf65d3c7c743f5c027f3f4fbd81708348a114f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:141-149 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:197-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1bb7d090dcf49f97a9d8909a09ad268aa3d0b9684633bcf05f67fbeb204055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:429-437 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1234-1242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:429\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e3f372c0301a4dcc3a5a35c2fa0ed124320e4f0ab65bfa2064d3c521ca3dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1446-1454 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1855-1863 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3fa72b3c29101c06fc43d98ef8d850cbc86b14906789ac8ff6b4157dfd29aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:1286-1294 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:2384-2392 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:1286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"af70873639854154706fc0d4e3d5c0cd7d7abe73cd94632458f95eb1c0a77302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2149-2157 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:827-835 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40376650f2886c46dc9cb2062d572007a93ab57128d54b3a7cab715c0459e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2800-2808 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:685-693 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2800\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e92f9e96c207f4982014d056b25c29c49f721309b1bed7b0ecca6c952e269e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarInsertStatement.java:50-58 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/ast/stmt/PGInsertStatement.java:48-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarInsertStatement.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80d8b41ebd93b20a420022f6d1d266850d0322130a0349f7f1a5fa1dc3adc85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarInsertStatement.java:112-120 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/ast/stmt/PGInsertStatement.java:110-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarInsertStatement.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarInsertStatement.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cd43f612f7598d9d1ab0a9dcb82f943d1ae71b126b494e04bd3b60f9d968e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java:153-161 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java:146-154 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarSelectParser.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8653d60b286aec875849bf1bd2be50cff7201a0bf59e6102ec5cf7b4cb5ac919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:284-292 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:287-295 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7966413f7059b4a6034c59a2d7298f5f3443038d2a0b7d03129cc097bca6ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:275-283 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:357-365 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:275\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9767a184234eadc01b5a975f983fddcfe2f14d6a9e0acd4b242b30fc6bdf54f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1228-1236 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1269-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:1228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a11bd550fcf950724d783141dda8fa974bca18e85e63c86fcfae5d5df9f7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeExprParser.java:242-250 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeExprParser.java:251-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeExprParser.java:242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeExprParser.java"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e657a175f513537e9091a7b4ee32f3c9c460ab1b8221091aea1fee5d33fade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteStatementParser.java:55-63 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4869-4879 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteStatementParser.java:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteStatementParser.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc044f19de9378018d25a6c5f2c63bc06d524a47ca095b804c099510597b20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerSelectParser.java:179-187 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2060-2068 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerSelectParser.java:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerSelectParser.java"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e719db6a4fa201ec726e3a262e7d6001f46e09a3aaf48075544bda2cb62febf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java:377-385 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8250-8258 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb6c1e799d2cc610cd4e28f67c7fb4ce81142d41224843da523658fff74f4b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1206-1215 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1225-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:1206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82f896987beda14c98b58f77d58dd25ba6114b56bb584ef78c1b779a7ed3f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2073-2081 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:6085-6095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2073\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"550f244d1e71f919d3f95e03ea3d813fc7ac1f45e470fb080ab79cacabe7e125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4573-4581 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4634-4642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4573\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"85015aad49a42f690564e661fb655ee62ebe76daf726ca99f4c98145a9ba201c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5587-5595 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5606-5614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5587\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4392db2a802c1fa76a7a74caa942b1f48a5562ed925c0d5cbe1b15b804ff8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2242-2250 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2270-2278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:2242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b27758592c3639acd5ef422e36a405b4c8a19a95a373927555fd1925301f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6189-6197 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6801-6809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd591152987192f522b80deb0ad98b64f2c319552d09380fc6e9a150a241cacd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6307-6315 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6845-6853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd68ad038c35e82eac8d45db8a1cbf8d080d64a1d0671c0b4be80d82422bf47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/functions/If.java:32-40 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Isnull.java:30-38 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/functions/If.java:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/If.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8130df664a56392abda1579c2cedac7ed12ef7b9f410b5de87a020ab4f13b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5723-5731 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5743-5751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:5723\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":5723}}}],"partialFingerprints":{"codehealthFindingId/v1":"73538269a9155be44ece026e31920c36a738b961edd9c4a99a7f84594a46485e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8602-8610 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8675-8683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:8602\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":8602}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b52fd61b690e737db2e138dc6d6d5b40bbcf1c23ce7d3343b02e55936e82f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10841-10849 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10860-10868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10841\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":10841}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e6611267635ce17bca0a5c6b40c4c49d387a628240064446cf49512dcee2db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11968-11976 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:11999-12007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":11968}}}],"partialFingerprints":{"codehealthFindingId/v1":"030960c3bfb81ae5af6e60f5b88fa62207e7bcb9100de05d3fda03e9a3b3255f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:834-841 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:852-859 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:868-875 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:885-892 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:903-910 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:919-926 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:834\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cbaf77c501778e1a7eff58ec8508110e7cd8409fe8dee3dd0e07a8858e83fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6122-6129 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6141-6148 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6160-6167 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6423-6430 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6441-6448 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6458-6465 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6122}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a37079f6458a007fbd015b7434e8a4c32faa548304b2ee534152a63cc11508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6055-6062 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6070-6077 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6388-6395 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6403-6410 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6418-6425 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6055\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":6055}}}],"partialFingerprints":{"codehealthFindingId/v1":"53721bec3148d8dc6858634e72a81d2c32a4333fdeae2499d80a61ac3add8c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6201-6208 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6733-6740 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6752-6759 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6771-6778 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6817-6824 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:6201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":6201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27b7e0ec5ca2d36c2cdc14fe71f43b28568873d5f66f37abd97684716ca35a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:622-629 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5352-5359 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5420-5427 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5464-5471 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:622\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2b433acd81c5ff01611d3826a38a3a163b7cf95ff3461c19a71cd750a4ae0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2512-2519 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2639-2646 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2886-2893 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:10270-10277 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2512\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"045627397c3cf9383a7d2aee27d484b2ab68d2a8aa056d345953218f08a71ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:407-414 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:358-365 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1197-1204 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1575-1582 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:407\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a216558cf5618acecb6e67091b1991fff2876098fb20026dd87807f7e9186a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:461-468 | core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java:189-196 | core/src/main/java/com/alibaba/druid/sql/ast/SQLObjectImpl.java:234-241 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:461\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4abdfbfdad17beaf2c79cf9fb55363ea58b6bc262f5338f684a4547c23fc9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java:73-80 | core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java:116-123 | core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java:136-143 \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 \u0060core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"297ba669f25173e1ed199412587883434807f2b2889fb4edaf1e987f81b100d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKSelectParser.java:159-166 | core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java:204-211 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:1052-1059 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKSelectParser.java:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKSelectParser.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e688f45f7439c3a0751771672dfc067bd3eb061afdea0f5dd7cabe8289834e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:201-208 | core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:226-233 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/visitor/ImpalaOutputVisitor.java:187-194 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/visitor/GaussDbOutputVisitor.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdd428ece1ea2bd85d6368922e3df9cdbfa9e9857dc63917cd89b6f7a9b1fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:489-497 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:972-979 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:404-411 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:489\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0100cc238e07a7b9b7a178ebf012e7f9634f7a01b4cd67be5db75c9ce9dc7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1938-1945 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:3693-3700 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4070-4077 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1938\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a5e649950bf111348e3af49db22b7157c300e121fd3d41e3ab2430a551db69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8305-8313 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2797-2804 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:682-689 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8305\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8affa9333d72b8cb9c9a3fb880db6f6214795188f80939d212cc0d5d0c8d0d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:993-1000 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2800-2807 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:685-692 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:993\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"98874c577e0a75154bfd6da48d62e46a3c8b3bc33928cdaabec8a557ca276fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:714-721 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2111-2118 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2604-2611 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:714\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b0884f38b0863f2e802153d12698d559d0f04a33d859b692ebfd41dce7a630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:728-735 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2125-2132 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2618-2625 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:728\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"032eb079bafbb633f26b87e6b6120e1250e80531f3c0a51fc9a60feaa5998442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1075-1082 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:1281-1288 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:1658-1665 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1075\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"11797871d9dbf6e1e85130c1cd4b01878c301ea4dc1b75a8c2c2fd529c9f3f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1480-1487 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:2233-2240 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2726-2733 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:1480\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a6648bea21de23f2f7e8934069da04264014eae5a99ededf78f0021b03681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1748-1756 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1802-1809 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1831-1838 \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 \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:1748\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a9ab0d46573cae183f31c65fb615e19dbdf627186c6b9c4fc558cc6010da7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Left.java:38-45 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Right.java:38-45 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Substring.java:49-56 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Left.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1909e3929c6278683398bf483afdf5dc1f9efd729ce51c38c48224db831b9e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:509-516 | core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:535-542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:509\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3d20877892839fad7763f8957107c31ecade872ee272a9d0816d51efe0b1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:850-858 | core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:881-888 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8508dea59110d056bf88f28956b901c72e70701f99887983d0883a945b7d499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:3381-3388 | core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:3397-3404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java:3381\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3737e61bb039ffd2fb0e480992a9a1721082bdd4bf94375c5d4341bad4091d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:260-268 | core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:270-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":"core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6bdd8d689cbbe19f64c4f1553571259009640fab612f0f947d93932539296a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java:322-329 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMethodInvokeExpr.java:388-395 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java:322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLAggregateExpr.java"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf30df68d900f81dfdd0dfbd7a4c7955cb2d24a9ce2ee7bcc7d01dcaa1895ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableAddIndex.java:46-53 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableAlterIndex.java:46-53 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableAddIndex.java:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableAddIndex.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"07733520f5c39445a40405ab24ac4fb0fba40b2d780d58a0d11ab48aae12a02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:177-184 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:249-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:177\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee4fbc74f960ef3f8e568cb96348d4d90a790b762b45df276a767e076a7813a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnionQuery.java:252-259 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:2430-2437 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnionQuery.java:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnionQuery.java"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"16955deccc8d031bc9da90e3e99cca082d7d6ed31764bed7efc5b3b6f1b5130e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnionQueryTableSource.java:76-83 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlUpdateTableSource.java:60-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnionQueryTableSource.java:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUnionQueryTableSource.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2aad78638653820aaebffbe52f1721f9664ac049a5ce36ee465ccbb1e9bdcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLValuesTableSource.java:129-137 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLWithSubqueryClause.java:157-164 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLValuesTableSource.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5875e708b593992014292655f95f62a310867242f43812e37c86576af2616a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:484-491 | core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java:504-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. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/SQLDataTypeImpl.java"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d1a31ef919e0c9959123faf11c76ae994ecfa26a91318d674ba26d6ac9fab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java:60-67 | core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java:95-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLIndexOptions.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b012165c593aee793375fae0188126f2b2d94782707031aee2546af2939f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/SQLOrderBy.java:67-74 | core/src/main/java/com/alibaba/druid/sql/ast/SQLZOrderBy.java:67-74 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/SQLOrderBy.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c107f5dc14fb9fa011a5dd4566d5de7bd51044ba48cc19191f0c3d80bc5645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java:84-91 | core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java:108-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/TDDLHint.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc210acdd8af1cac913614dc45495f2b914a1c2d6d90dde912238ed89fe07c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:159-166 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:758-765 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2ExprParser.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b5e35f0602a827d72fcdea0986bed482751aff7de6860e57b3eabde781ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2StatementParser.java:95-102 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4818-4826 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2StatementParser.java:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2StatementParser.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c0e9f527142308be33e0661194d15387c3882a502987295113475c3cdece82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:420-428 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteStatementParser.java:58-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java:420\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveStatementParser.java"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4aaa63cdba5fa0dfc2594ac41dd8e5fba7cbf211c57e59bbc8f29e9f7f5519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java:386-393 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:6277-6284 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/visitor/HiveOutputVisitor.java"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"989830b0ae0a7614c6ad3c7bfc1516733f8913c017e04dc13e3ee7decfb249ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:125-132 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:133-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"750e0ef614f05b75c8f04a68eac8160b3dfeafda9e64c89677fc4ba9a62b1bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:218-225 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5936-5943 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef36e5a71a3f9085043513f2823bb8611f0f65e519b59931cc11f056140a2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2335-2342 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2426-2433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f03a5c8e283ed933e148f2275e33708d7034041ec9e20bc87a078d11bdbd57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:523-530 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:176-183 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:523\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"910dc1508c556fbd00028c4b91134d3073887aa2158ca679ec4b5e1322d26737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8117-8124 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8131-8138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2977f80a9341d6821063c65c0f4b611887b5a7138943ec1770a2b4748afc2126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:9174-9181 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:247-254 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:9174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":9174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dec710361c87dc20a59d0bd75376303fee7e968742fbf86a25757c5cee173ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:851-858 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/visitor/PrestoOutputVisitor.java:190-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:851\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bf5743e57f5860fefb0a315f82b999b0f6ae8a95a3bbdfbcb34f09c2dbdea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2534-2541 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2687-2694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:2534\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"36260747af54c9f4957a4d8ee41707956d2de56e4a9515a8de1e3146db63d3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:634-641 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:652-659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:634\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61bf019fec057b748179f4021853efcec0c9825bdabaadbe60e860f06de6bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:797-804 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:922-929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java:797\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5274a1542c6f406318dad5e8e235d165d257fa15f6a939fd4e9ad266ae263e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java:208-215 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2682-2689 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java:208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleCreateTableParser.java"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d2a51e7fa04ef33969f61139b888793c554b2f0278d609ec6aeb41ff7336cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:229-236 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:255-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecbc3e4984496c9a13df70a326065f0f0e420daea4e7bf08293a0675647bd03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:795-802 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:807-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:795\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"633bcdd6cc91e6a59b8d0f230dcae61912cb708c6c0c136e0be68c565cd4a815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1236-1243 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2604-2611 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1236\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f2cda2b7dcdff46a5220bcbf13ac0782db568bf6a0712f8b9693e56c06be1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1801-1808 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:1049-1056 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1801\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2ad4cda9da0d07954838aa0934508c0fe12cd1114bdc408321b8ee04ee8cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2237-2244 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:852-859 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"afba857e292947a683f6de3bd9081e558f1710a1e813aa69a686e178b16f5f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2203-2210 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java:2217-2224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"857be0b721c8b912f7204d0b1e132aa894efd7e3835fe4dfe8d7c00615e82e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarSelectQueryBlock.java:50-57 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/ast/stmt/PGSelectQueryBlock.java:69-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarSelectQueryBlock.java:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/ast/stmt/OscarSelectQueryBlock.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"36608ff9a9ed411dc90d9ec084565192cf8deffb07d965796c4d8baa33fac3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:494-501 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:858-865 \u2014 before extracting anything, compare \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 921 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec74e57e7be4fc0cbf2af7d17d43d422e269a1f2f4bcef52f487b4b3be9fe5c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:41-48 | core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java:224-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db9ca87c19a456d6b8968d3893e7aac0f32dd41e7633d4e92b1b33260f96ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/redshift/stmt/RedshiftSelectQueryBlock.java:67-74 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/ast/SQLServerSelectQueryBlock.java:66-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/sql/dialect/redshift/stmt/RedshiftSelectQueryBlock.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0335cfcda66795f24bc225fcc563d762d68a6b68ff11ad5d6e3e8d2e44cb14fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java:86-93 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java: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":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeSelectParser.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e7c5d680eb17c2dd3514ef510448e24501098056791377d195af6744b08929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:580-587 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:680-687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd088a7132df59931d6ead11c57db742b31dcaaec2c8e027c2288ff1251c41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:587-594 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:617-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:587\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e82b365737125651d50236f1a7226b194ad8f13b04bb5377cfc0823a7b6de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2740-2747 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2795-2802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2740\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"5171d4b2c0b7f9757c6a82e2527347fbae6d6caf614dd0dfe0019b99239a561f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:807-814 | core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:1050-1057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java:807\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParserUtils.java"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"6087e830d8c2a1fe9b7ff234632ee8d16ca997108a0445b92c2fef4a103e7398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:620-627 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:5913-5920 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:620\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"c356f812994db4c99e9bbc0b50669a1748c5c9fe1dbb3d1737bd482e02cbd50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:3903-3910 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7099-7107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:3903\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":3903}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e163547567205d57a262006dc0abe0a096392083a8f516a8b6eea26cbc5f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1058-1065 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1067-1074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1058\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"257f7e2e50764f038edd6a21d6db7bced6e09be20eca66f1a6cffc28d5bc9b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1564-1571 | core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1828-1835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java:1564\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/repository/SchemaResolveVisitorFactory.java"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb42090f1f03e7ae131fd57899776c648a3643d16837b1a4b6e346d4df141716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java:330-337 | core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java:357-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java:330\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"490e0b42a0289c9067e61b047c0009959884fd4d7894a2ef08a57a808cff62bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:933-939 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:947-953 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:961-967 | core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java:976-982 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/stat/StatFilter.java"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"40343c793ffab7c5115c9cd77ae9aabd907f9262daa06b5827907f8a8930f1b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:668-674 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5366-5373 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5434-5441 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5478-5485 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:668\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6d272d2627436925f03d399e9b79b7846d625229156b5d8fea81b7dd117b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:619-625 | core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:638-644 | core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:738-744 \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":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"3544ffb44e0dae0c1ba4c7f815f62158982241e23f251710703dfa87079cacd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:31-37 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:53-59 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:64-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcd27b12072bb4ef5c44d542a07e814882c336aa6654f2b84d786987d58e7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java:198-204 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:573-579 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:698-704 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/visitor/H2OutputVisitor.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6987613a27e0e2c441763967ad2e77457bf3aa4eea4a98e31e8715cb3e607bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/hologres/parser/HologresCreateTableParser.java:24-30 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:37-43 | core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java:219-227 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hologres/parser/HologresCreateTableParser.java:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hologres/parser/HologresCreateTableParser.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"965d6bd35e29a51b9b467988c2d67cc2c1ca994b24e1dfe219a2b464678d4b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:907-913 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:1234-1240 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGCreateTableParser.java:148-154 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:907\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c2029af43e0772b9a4874e3176f735e36ef2c55697b67cf6fa0e5e976b9811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:767-773 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:791-797 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:815-821 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:767\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"33952c57aadd968ccb9cf0e8b5aa0c5f9ceee95d5d8f7bad8479d964825a4433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:111-117 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1028-1034 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:1122-1128 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d211b4875ed01a558d97841aa738856ca06ed7e33f2b2e03f86e26a99e54984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:555-561 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/parser/OscarExprParser.java:247-253 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:434-440 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:555\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"339699b0f9914044667ab5b9ef6a20d01193c2c599b7e67b8bbea1a2a133bc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Insert.java:37-43 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lpad.java:40-46 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Rpad.java:44-50 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Insert.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5422d367fae0fa4d084b277fca6aa8288ac3cf89994d0c55fbd549e1199e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lcase.java:51-57 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Length.java:50-56 | core/src/main/java/com/alibaba/druid/sql/visitor/functions/Ucase.java:50-56 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lcase.java:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/visitor/functions/Lcase.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"237ab9e84723b575b462d30b31ac3836836673c0211ed1aaceaea8b1ae70bfad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:600-606 | core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java:798-804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"87821177aafa88e1dd69bc47c63e32e0918b3db0a13c54a8d5bf735116cf369d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:854-860 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:964-971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:854\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0769d9f29625dde7798336379e7384c42c54dfe723ff7f81a784bd6c1e52d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java:393-399 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/ast/stmt/OracleUpdateStatement.java:152-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java:393\u0060 it begins part-way through the construct above it, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLUpdateStatement.java"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"9520205cff85eb57a9787209324f1d31410528bdac3a82740627bba318830fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryExprParser.java:80-86 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:812-818 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryExprParser.java:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryExprParser.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecd5a10a20d7162129e225cac1ce123b47fc7fe17b9248c25a34f822994d17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryExprParser.java:321-327 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoExprParser.java:96-102 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryExprParser.java:321\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryExprParser.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f6d396fc9fa7b4e6cbb540e336841fdbc62d4a2b83b65df3607718fcf21e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKExprParser.java:93-99 | core/src/main/java/com/alibaba/druid/sql/dialect/spark/parser/SparkExprParser.java:65-71 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKExprParser.java:93\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKExprParser.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda4bbf8f584b4a33ba262465ef611e313453b23f0d51df862296d0d5dec179f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java:72-78 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:3180-3186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bfaeb204b312bfde1b9c9671e5be31ea17c1c77854bd28df35f6c6f4a2833d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:175-181 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:350-356 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:175\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6bce3edcbd6989340dada6c446fadf2f59c47bc1fb9ae9328f32c5e2caf69a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2StatementParser.java:67-74 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlite/parser/SQLiteStatementParser.java:93-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2StatementParser.java:67\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/h2/parser/H2StatementParser.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c7d6b44e3a00ff616df1836b7f343f805fbb94d2f653eeba15a91c7bae20b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:59-65 | core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java:128-134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8b557ec402e354a30f3c1ca4f114edf8ee444ed0bff98662dd0471f3c20b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java:72-79 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java:116-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java:72\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e644dede69c1f73af9a3bc4ad643801704519b83ae9180207f755d37df75f40a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:973-979 | core/src/main/java/com/alibaba/druid/sql/parser/SQLCreateTableParser.java:261-267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java:973\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlCreateTableParser.java"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72ca0acbfa3e96b5c7eaa95ba9217f7203ef9e3d23d007334aea79a9e48fff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2608-2614 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2634-2640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:2608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"91289c9687783ca3713affb7a2e218817573c099d3da5ff1d0b6633f01b53320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:292-298 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:524-530 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java:292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlSelectParser.java"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0746a67421949e83d0c4f1e98c57516a96091c9b9873963559dd829b39194241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1637-1643 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8578-8584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:1637\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"441ba476cc528a04dc2f8115502b430be7bd9676b4961e43db7fb1a121b8d109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4499-4505 | core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java:497-503 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4499\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4499}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c8284e4f03f5d2b2c801339b40603f7c3e4e35483b3e7def4e1622c75be359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4972-4978 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:425-431 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:4972\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":4972}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6272402ab401993fe36d6f9a1792c95d226afc545007510d7f83bf55b416180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5151-5157 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8069-8076 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:5151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":5151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21f20428fad01dd2da1684e4d215bf5c40a1051aa74315907b0308a2dc33afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7628-7634 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:304-310 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7628\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7628}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0305871ba444c33b2de0d63f547716f863c6819dbdc094ad4ebb1c575b367b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:469-476 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:498-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:469\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd254f737a27d22a7bb438cd62477e6af5d82f273c82b3355e28acc83a93432e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:362-368 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:1623-1629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java:362\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f216ac363606a1bf1512b68b5959e9ffa3d62f394bde8829f656f3879c6fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:400-406 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:1177-1183 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:400\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e37da160ee5e5f27abc7febb1a18d9194ac655d95fdfdde1cfc9d0792d8404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:687-693 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1065-1071 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:687\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3964c86fd7562d9943075c5a8db8715e1fa3d95b221b914c0f522d55beb3aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1190-1196 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1310-1316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java:1190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleExprParser.java"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1049d0bff855588d984270da5bb3edc0a70f1bcb87a92a6ffa501ae3f420a0fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1693-1699 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1709-1715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1693\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"78291c2f14fcc73f753b6866cf04e913f7cffd60d637b025328842a433003f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2189-2195 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2215-2221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:2189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f1d08ca69383fe863660e5233d879353ae88c43a3cb1cef55ab54cd0722254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeLexer.java:221-227 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2415-2421 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeLexer.java:221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeLexer.java"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb0f26f8ce92a2a4480fe10353d9537e1061a2b30306c5b99af35871dd4f919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:172-178 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:182-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":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"546a769e4411ca91914bb9e393e7b8ce84830fc877172678191decabf9760ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:896-902 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:991-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:896\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7f31bd397f17f8f78ee62773c54bada1f53b133b81a8e80ec3722e17c7c2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2775-2781 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2799-2805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:2775\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113132bf69fe44eca44c6d263758709c8cecf8ffb7786e84f6ced22e1fb6685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4738-4744 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4748-4754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4738}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef49d96d08dd949d9f00e6e171e24d2b1b1108e3605fff0633fef0260415b16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5207-5213 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5280-5286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e624635cd728dd41eb760aecee140ab6750e6bb9112229d62ac9d9cc701817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5271-5278 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5316-5322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:5271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":5271}}}],"partialFingerprints":{"codehealthFindingId/v1":"090de20654677189450727920a3aeec1ce5f67bf767eaa0a5fe09332452d16f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java:235-241 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:1622-1628 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLParser.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0443ca1c3779a2167246c7c6b65f7bb8120b3725f998e718c334fb5a30c61f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:948-955 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:1176-1182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:948\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ceba1b58def79687b87a0a5e35065dd248998196ff35ebd2d33599ec59ddbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:1277-1283 | core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:1675-1681 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java:1277\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1f008a59c6b7dcbc86ed7cc7e6f1ee80237e2a9d0bea00769d64a8c8cdbfeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4753-4759 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:7388-7394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:4753\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":4753}}}],"partialFingerprints":{"codehealthFindingId/v1":"6024ee9cdaf33318abf23afe23cedf7ee155333f333d25377a5f17df0c143786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitorBinaryOpSupport.java:218-224 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitorBinaryOpSupport.java:239-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":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitorBinaryOpSupport.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed06896ea413c1a185fd23c9afb24485d2be68543e945bb6d98d25305c34c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:200-205 | core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:228-233 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarOutputVisitor.java:366-371 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:363-368 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java:150-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b756db8e72b3e7d6b7994d048f995c7c198bd0278d08c193861b98e91fd01839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:95-100 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:125-130 | core/src/main/java/com/alibaba/druid/sql/dialect/impala/parser/ImpalaCreateTableParser.java:133-138 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveCreateTableParser.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c25f42dedfcc8ceb12d49fc4a9ce4b2e784d8026721d358945ab9f38f9fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8631-8636 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:8641-8649 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleStatementParser.java:1185-1190 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":8631}}}],"partialFingerprints":{"codehealthFindingId/v1":"836e43d0cd50fe58a1eac1d6abf3825dcd4f9818a8459e836e020238397ff299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3536-3541 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3691-3696 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3708-3713 \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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3536\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"919659a4d6f6f8b4664bae2fc1e0490bc4ec3e315bd898b0a577198b2eb9b902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:450-455 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:460-465 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:470-475 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java:450\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsExprParser.java"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"427c712336eff7ca35e048687fab891074ec1f3cc88ff314a76dc50fa1cae11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java:2104-2109 | core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:281-286 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7a265520903d22a91a2f2b2793eccc7c2ab7640e101eb502c1cf861a24456e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:841-846 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:874-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:841\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0df1f6cdc7e0d12b43f47174847392c2a159c9ed64ba17902c86dba88f7bf52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:1666-1671 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:1700-1705 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java:1666\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectQueryBlock.java"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc9666eedcfd3da9bdd820c6c409e00a280b55417af872c8740768319aeeb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSubqueryTableSource.java:177-182 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSubqueryTableSource.java:190-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSubqueryTableSource.java:177\u0060 it does not close everything it opens, so those exact 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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSubqueryTableSource.java"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e235e48d0b1422e46dc8e24ae1fdfd0070adce35146a80e8e62d5fcd0177352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java:69-74 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/parser/OracleSelectParser.java:271-276 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java:69\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/db2/parser/DB2SelectParser.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"963cac02147c2482ecf515291bedfb9ce7b2c173c09adb1716681af42127c05f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java:28-33 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:2583-2588 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/doris/visitor/DorisOutputVisitor.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"15188083dcc3e39d1c42cf20d6232f0b931b1b3d020aef472ff6f0a6fbb4db7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:101-106 | core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:129-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b04ea2db6b804a81dcb435f8aa9fc39ec72f6b4ecd614f2fcc187c975582cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:190-195 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGExprParser.java:361-366 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java:190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/gaussdb/parser/GaussDbExprParser.java"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69cf8a39590b640d833613c5a2de47f288bad47d065551ba4fa06b9cbb2cfd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:224-230 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:1408-1413 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/hive/parser/HiveExprParser.java"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf9198e1d57f1774d46162f7cf71482a73f732b0ed6eb8f62304b31c8007fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:668-673 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:692-697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java:668\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlLexer.java"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a096ad8762d9abc80b6863531615a4531b117eb2ccfe682a0d12f461fe1261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6118-6123 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:3268-3273 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:6118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":6118}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e878310fc491f24e6b30d1d09c6dd03865b918d6279f289137f0fe302af306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:77-82 | core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:122-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcca43116c0cbafd04069c1103d599f7df6415148b4b7ae253682fdbc6ae45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:95-100 | core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:115-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8a35caba5d02e34bcd1108b2295139aab151475dc907a82b23da69ef17cdfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:371-376 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:414-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"402f53343a7894d8749e531632d8f2858727cfa8b9d95e143a925b2e5e32f6d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4172-4177 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4221-4226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":4172}}}],"partialFingerprints":{"codehealthFindingId/v1":"273145d7872acdd53ec64edaf52c293b5ce37bf205bfd72fa88c72b470afa60b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:2801-2806 | core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:5080-5086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java:2801\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e788d961899cd7764cf8352b0a8bd04d1956d4f32b220d5facae3d424f928b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:347-351 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:371-375 | core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:414-418 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java:347\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/snowflake/SnowflakeStatementParser.java"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7657e7061f8579057cc17def66f92f30e533273c9c1c125e7cd7f1591123ccbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:452-456 | core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:468-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:452\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b5adf705baba51a0473ee610e034619ddb8f1ea760cd61d6fd992c44d0e659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:576-580 | core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:592-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java:576\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e2ce2b2a5e43b5d458e3d566a2e16550e3962c8258139993219c66dc524c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/ha/node/ZookeeperNodeListener.java:267-271 | core/src/main/java/com/alibaba/druid/pool/ha/node/ZookeeperNodeListener.java:272-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/pool/ha/node/ZookeeperNodeListener.java:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/ha/node/ZookeeperNodeListener.java"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a980fd11377f76817207e0f6e9e108aa2200aa6225de3f938552fa20b6d766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java:2067-2072 | core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:226-230 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce467985bffb6096b8da456f4abc5d1737890abffea5402a21a59633ecb78cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java:2081-2086 | core/src/main/java/com/alibaba/druid/proxy/jdbc/DataSourceProxyImpl.java:246-250 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/src/main/java/com/alibaba/druid/pool/DruidAbstractDataSource.java"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb8885e01b19ea2432a2bbf3531801bedbfc400653129f5048bb297fff9f731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java:114-118 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLInListExpr.java:158-162 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLContainsExpr.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8566192f40cfae316ad6688986a9318ecb94f8f61888164e05c958b129b58915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLExtractExpr.java:87-91 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLIntervalExpr.java:101-105 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLExtractExpr.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5402b5ce973ab7aa45cc439d350e0d1fb69175a330873c66dd7f572f7753c122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:833-837 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:861-865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:833\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a5c89eabf2ff7106dbf96a6d64e136729f257e98f6028d3ecbc8dc05eacb00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1094-1098 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1135-1139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1094\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"157afa4f5a18dd887f88e34462e1bbb7fea3f0fe219876e30d6c153a7bf2bb53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1108-1112 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1121-1125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ff8aa60903077e29940608f63869fc58982c4e0f691469eab6ceaa170f443a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1186-1190 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1272-1276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java:1186\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLCreateTableStatement.java"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4230873dfb5276403ede6d87a013cd3b7d8b36a1601220c68dda769e774bef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:198-202 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java:114-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/visitor/DmOutputVisitor.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a08513e59161d1f6f6f2fa268a5b50a4be5ed02de37d949196dd3d1a171f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java:83-87 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java:129-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/ast/statement/MySqlHintStatement.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"091c4e888577e9da355fdf5fffa43a8948c0cc96e03d3254a3f3c79fed7d1ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:122-126 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:127-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab300617d81ccc7e1a6464ea70c6101834513211bff145f90d7b191e77535a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:128-132 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:133-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff89603f8d04dfac702659c4733a39731c139201abd94aee86813331d0123f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:138-142 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:143-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 \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlExprParser.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"902ace9958437d364e578253554da3062320aa5800ce676cb5d26692e46315e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7667-7671 | core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java:1018-1023 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7667\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7667}}}],"partialFingerprints":{"codehealthFindingId/v1":"832d509c16e0900768d9a1bb2d19d33c42295bf17477e3d91fcc48f7c90dcd96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7826-7830 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7855-7859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java:7826\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":7826}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b5d406b04d5e1aef60e8b4b4a6c3491d5b09c0232a3e3b7620149d975dd6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3023-3027 | core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:3051-3055 \u2014 both copies are in the same file, so extract the block 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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e79328a102b42be4792b7cc40b62e041c760523bbef6d43ef569c67bc4686a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4258-4262 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7794-7799 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java:4258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":4258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2450147e709f2bad7b11fc1e5b988f24f656ff6fa99097563bb61e0291320fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:482-486 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:2047-2051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java:482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc6a1d374be37e39b31da7a720e01b3ecd96ce95c613ff7d5fc4b2d762c509d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2075-2079 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2196-2200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:2075\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"2419e2a4c77376a850dc7e3df3e9e6b71e5049fd48b289e2067b8972bc7701a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:3335-3339 | core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java:3343-3347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/Lexer.java"},"region":{"startLine":3335}}}],"partialFingerprints":{"codehealthFindingId/v1":"84394336403596df16f560fe5242206997b6263374dafb1a70ad82c47199d69a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3293-3297 | core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:4199-4203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java:3293\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLExprParser.java"},"region":{"startLine":3293}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1b4359c91e95ee1bf55326f401b26cc686d9d05d63e8182179add9a6ee442e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7320-7324 | core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7404-7408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java:7320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/SQLASTOutputVisitor.java"},"region":{"startLine":7320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6636e67795db1494f52b24e58bcc31cfae677e29c3770e114694180efdc37f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMatchAgainstExpr.java:150-179 | core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLTimestampExpr.java:208-237 | core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLSelectOrderByItem.java:110-139 \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":"core/src/main/java/com/alibaba/druid/sql/ast/expr/SQLMatchAgainstExpr.java"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"51370c6dd1c78077f9c326501accd5e1ea8324dfefac64c106ab2b083b1ee88c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java:189-217 | core/src/main/java/com/alibaba/druid/sql/dialect/oscar/visitor/OscarStatementParser.java:423-451 | core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java:921-949 \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":"core/src/main/java/com/alibaba/druid/sql/dialect/dm/parser/DmStatementParser.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97c342bff84a9b12a40a06ecc6d9f4f6d0544be01ca27678d41fc8d605dfd2e"}},{"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":"e9f47e4e578561ea63c5451efd6b0ec32c3a9e886a2ac1d3ba458b4d3d1b1c94"},"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: core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java: core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java changed 3 times in last 90 days, max complexity 275. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/parser/MySqlStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74516754780a37270a715d5bf2562a62b19025d35005e8888c9b4fb35ea17c6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java: core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java changed 2 times in last 90 days, max complexity 161. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLSelectParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f876c07a4b3b054db59a349ac43875a19d3a2f5913461a1e5e637d891854c5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java: core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java changed 3 times in last 90 days, max complexity 79. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/parser/SQLStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca7aa0adef7159c0e38e95847547fe4cb225e64fb82945064be9fbe3a4efec4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java: core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java changed 2 times in last 90 days, max complexity 65. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f58c1feb38ae214435e68674fee5ad8c35d0c5abb6cd7a96f57b025732acc0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java: core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java changed 2 times in last 90 days, max complexity 48. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/pool/DruidDataSource.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce867397bf96d07c2ff49c8494368dadf9acb47be7fd5fa744310a0dd2dc71b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java: core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java changed 2 times in last 90 days, max complexity 45. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bdd3a212b2aff390abed517d47918eda66a607773823bcec6f752541e480e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java: core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java changed 2 times in last 90 days, max complexity 41. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSelectParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daed54f678720b7aaf2a62e0782b7383e7e8ddece3bfaf91355ec624d4e1e16a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java: core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java changed 2 times in last 90 days, max complexity 40. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/visitor/PGOutputVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8b590d1acbb684074d8cdefc9b0869973475084beb07d07ec3713cf166959e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java: core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java changed 2 times in last 90 days, max complexity 23. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/postgresql/parser/PGSQLStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed37aaf167bee1565081a855b4bfc07348eb7aefcb89934b00036931ab2a60f6"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: core/src/main/java/com/alibaba/druid/proxy/jdbc/ResultSetProxyImpl.java, core/src/main/java/com/alibaba/druid/stat/JdbcSqlStat.java, core/src/main/java/com/alibaba/druid/filter/logging/LogFilter.java, core/src/main/java/com/alibaba/druid/filter/logging/CommonsLogFilter.java, core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLAlterTableAlterColumn.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c36963175a440d95112fde5cd3bb4f2f1e666d7ec3848d1ec81368732e5a962c"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 5 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 (11 single-owned of 454 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (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":"D19","level":"note","message":{"text":"The Test Infrastructure Guide mentions a recommended validation lane but does not state which tests fall under each lane (e.g. the LateralViewTest subset) or how to run the full gate.: Add a short test-lane mapping table that lists each lane and the corresponding test names."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/TEST_INFRASTRUCTURE_GUIDE.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3630211e06c1bf3507cb56be74e40bcab5905855a07c983e1d91b3161515434"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e70c524555fbc7c33eff51cdbc22b580298e72da2250b4f5744ec4c297defd0"},"taxa":[{"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":"50f0f5fa1b90a2efbddcc5c84ef5f16e1b022cb8f590b01f17e9cf38326d6cfd"},"taxa":[{"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":"7216796ee01d05d47afd7ef6f6adcce46e611be4b692887df480e2efb003f1f4"},"taxa":[{"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":"5f90797c42f436588866b9ba264a74e22d2b3c7a87078d7003d820f77ea0a44a"},"taxa":[{"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":"821c6ca40899aae2cf4889a84577e65840e700b302be25f1c4cafe980fe7ac48"},"taxa":[{"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":"4423578e975833d58eaf44c6b04936729d0805314c876f56c837550a4f721269"},"taxa":[{"id":"CWE-200","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":"af5c71ca00edefc2f8e3d9c6a693d9a6ed2826b91ab0f4e78212f4c57d9ca68d"},"taxa":[{"id":"CWE-327","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":"3377b0db4d9f7a9e9f2e10e232948eac4047f8b9c3499abcc10bbc5681f5c1c0"},"taxa":[{"id":"CWE-327","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":"172f7b3c37ab398c5a17ad27cef3af6db65ce6dd9cb85f652e28a2f03ed9919d"},"taxa":[{"id":"CWE-79","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":"81eaecbeb158a3fff55bebe0413978a4499f00749196df614a312d6ffc6913a1"},"taxa":[{"id":"CWE-79","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":"16f88f8c8039c86a604f3b4aa38211060ebf602613aa2cc12779527a3d519dbf"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"core/src/main/java/com/alibaba/druid/filter/FilterChainImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fded8e25f48440ace08a14ccd26b2ebd4bfc8899e33b70876cef51353921fa36"}},{"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":"core/src/main/java/com/alibaba/druid/util/MySqlUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"611591cc1fdeef9f0c2a337915c70bbc93ba35b013cc49327aede2e9594341ad"}},{"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":"core/src/main/java/com/alibaba/druid/support/calcite/CalciteMySqlNodeVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"556360d9e6136cfb55a2e6f619a9eb922df4a9cbc1d2eeefe4cd9272ba32e139"}},{"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":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52f27c780a884532560e823252687b5cc6d06763112e2a489327187df4887cc"}},{"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":"core/src/main/java/com/alibaba/druid/sql/PagerUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56993823164aed4d39d32e32298cfa3192df6de5ab8196e5e3dfe4e71eb20e03"}},{"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":"core/src/main/java/com/alibaba/druid/wall/WallProvider.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b64e181a90ecfd3b580dae529ef6db36aa83b63fb4fc8c1c21dd8cbcbe3c81"}},{"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":"core/src/main/java/com/alibaba/druid/filter/encoding/EncodingConvertFilter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe5eb59616f7b2a3a4d38cfaaed839328a2269b17505cf1b7004bd4d526bdb8"}},{"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":"core/src/main/java/com/alibaba/druid/sql/ast/statement/SQLJoinTableSource.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"218542ff40de76fe4a5c0368bdc1e49a13c98f490cb77949d85642548090fbca"}},{"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":"core/src/main/java/com/alibaba/druid/support/http/stat/WebAppStatValue.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a83d757a160c69c4e26f108daca393160c36eaf5a16350a79cdb38202be08d2"}},{"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":"druid-admin/src/main/java/com/alibaba/druid/admin/service/MonitorStatService.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1491af87bff01045290568bb4cb52bef94991350b626c597bc5a3a596733909c"}},{"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":"core/src/main/java/com/alibaba/druid/sql/dialect/oracle/visitor/OracleRowNumToLimit.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe584f45584cf38289207050301e8b8aed1a8f90e89b8efa9b95a1de4c022a7"}},{"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":"core/src/main/java/com/alibaba/druid/sql/dialect/mysql/visitor/MySqlSchemaStatVisitor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d36c1331bda8c08cb15fc705af222647221d02a020113c85048cc6e8977a65a"}},{"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":"core/src/main/java/com/alibaba/druid/sql/dialect/presto/parser/PrestoStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56885290228a175710daa5063a7c1d865247ba16750a4fe32926e832776b0dac"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 176 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than listed individually (189 orphaned of 714 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SQLServerStatementParser.java \u2194 SQLServerASTVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerASTVisitor.java\u0060 change together 74% of the time (17 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23a8d0da77b623e785acaa52639abd51e72a2e3c7a59ca67fa3c78efb6a4806"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: OdpsCreateTableParser.java \u2194 OdpsOutputVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java\u0060 change together 68% of the time (17 of the 25 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsCreateTableParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d63192785c53f4308108f00e912c412d488ec1b105b89514740e0de7ee26f37"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SQLServerSelectParser.java \u2194 SQLServerOutputVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerSelectParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerOutputVisitor.java\u0060 change together 67% of the time (12 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerSelectParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c24417f9a47347cbb958a1149b044d59e7692e0b88f0dfd1672c28546a8745"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: OdpsSelectParser.java \u2194 OdpsOutputVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java\u0060 change together 67% of the time (12 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsSelectParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9aebb55960b51112b45ef305a7e8add151d0264077ba7fd2432c967b2cdf23"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: BigQueryStatementParser.java \u2194 BigQueryOutputVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryStatementParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/visitor/BigQueryOutputVisitor.java\u0060 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) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/bigquery/parser/BigQueryStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6625e1fd62d61139b39fb02a2eb19a3978b580d1e28495f8141fb64a4339fe"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: OdpsStatementParser.java \u2194 OdpsOutputVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/odps/visitor/OdpsOutputVisitor.java\u0060 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) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/odps/parser/OdpsStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da7ee266ce755093efc94656281c00b61ffde07a5f70b191f45e381cc7fb3f2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: StarRocksCreateTableParser.java \u2194 StarRocksOutputVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/visitor/StarRocksOutputVisitor.java\u0060 change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/starrocks/parser/StarRocksCreateTableParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"392468492fafaf56dabe34d936114492dddf7605584cb83b837abb03a77a9930"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: CKCreateTableParser.java \u2194 CKOutputVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKCreateTableParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/visitor/CKOutputVisitor.java\u0060 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) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/clickhouse/parser/CKCreateTableParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d324fd8f0d90cac5e27dd8338fd373ba6486714673d9c6bf2ae57cbc26c4b0a1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SQLServerStatementParser.java \u2194 SQLServerSchemaStatVisitor.java: \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/visitor/SQLServerSchemaStatVisitor.java\u0060 change together 62% of the time (15 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/dialect/sqlserver/parser/SQLServerStatementParser.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f704e6aea85bebed2ba929c1e97bae821150d427a690f71bfb17d4838653d8b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ExportParameterVisitorUtils.java \u2194 ParameterizedOutputVisitorUtils.java: \u0060core/src/main/java/com/alibaba/druid/sql/visitor/ExportParameterVisitorUtils.java\u0060 and \u0060core/src/main/java/com/alibaba/druid/sql/visitor/ParameterizedOutputVisitorUtils.java\u0060 change together 61% of the time (11 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/main/java/com/alibaba/druid/sql/visitor/ExportParameterVisitorUtils.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d477117cb8498a5e40bfddfadbc6fabc8d40f37d5b54e9849fc24e1e34e709"}},{"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":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}}],"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-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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"CWE-327","shortDescription":{"text":"CWE-327"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-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-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-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-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":16,"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."]}]}