{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"RcteTree.apply (cyclomatic 41): RcteTree.apply 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":"lib/sequel/plugins/rcte_tree.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d334ecbdcbd6c8fd2d89fd1ed14fd245c50ede7eaab19d1a7675f30adcf192"}},{"ruleId":"D1","level":"warning","message":{"text":"Dataset.graph (cyclomatic 39): Dataset.graph 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":"lib/sequel/dataset/graph.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e080a5c6189f98399578b77cedc95d21f1f9f9c89e7a8d3863d9c87bbac35a"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintValidations.process_generator_validations (cyclomatic 36): ConstraintValidations.process_generator_validations 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":"lib/sequel/extensions/constraint_validations.rb"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7fa4cf3997f0731ccd32a5d1b49b8ca1f30f633b1d4bd144bf59e7cf743031"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaDumper.recreate_column (cyclomatic 35): SchemaDumper.recreate_column 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":"lib/sequel/extensions/schema_dumper.rb"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f8de3c47bb402cbf60a8b42c93f43ddae51365cf0b47b7050f8dd7d8349995"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.def_one_to_many (cyclomatic 35): ClassMethods.def_one_to_many 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":"lib/sequel/model/associations.rb"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f4b771ccf6c3f67e5010cbe1b039f9893dedbc1fa96efa896eb63eae388fc3"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.def_many_to_many (cyclomatic 34): ClassMethods.def_many_to_many 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":"lib/sequel/model/associations.rb"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fed4fca36bb18a5407a3b5b604181dccc8c75b3607adcf96556a63fd1dd7e44"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.def_many_through_many (cyclomatic 34): ClassMethods.def_many_through_many 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":"lib/sequel/plugins/many_through_many.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba50caa29a76e4aae3f6e8cba6f38f51499fb952d9693c21135f6f6d2dcead4"}},{"ruleId":"D1","level":"warning","message":{"text":"Database.schema (cyclomatic 33): Database.schema 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":"lib/sequel/database/query.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2f5a572e2ca679e04a328aa70960e9ed8dfc8cd3d3768ae2afdd4b58c1c66e"}},{"ruleId":"D1","level":"warning","message":{"text":"Dataset.join_table (cyclomatic 32): Dataset.join_table 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":"lib/sequel/dataset/query.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce00247cdbf750c50d45937f9939b505058c404b58048c5cb7e0f0f0ac337b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Dataset.complex_expression_sql_append (cyclomatic 31): Dataset.complex_expression_sql_append 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":"lib/sequel/dataset/sql.rb"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7e46c80bb388f64aa4ea494c9b1bf1227777a7955b270505f162b0d84f2c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.associate (cyclomatic 31): ClassMethods.associate 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":"lib/sequel/model/associations.rb"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22a99054748dc33344052c5e3d3b1007de933769909acf446374a319dc3b042"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaDumper.column_schema_to_ruby_type (cyclomatic 30): SchemaDumper.column_schema_to_ruby_type 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":"lib/sequel/extensions/schema_dumper.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa5bb0daacd15e668a834b405dd8f1a1027c38bd5886985b5a789e11b9b3fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"ASTTransformer.v (cyclomatic 29): ASTTransformer.v 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":"lib/sequel/ast_transformer.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b014f7279be8f5906dd2825e4c897c00262539b9433de08344e1d1e1542a783"}},{"ruleId":"D1","level":"warning","message":{"text":"ToDot.v (cyclomatic 29): ToDot.v 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":"lib/sequel/extensions/to_dot.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6347b42440d991b69982397fc2cb96d5424ac5a3013884b5d6c1cbb7354a87e2"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseMethods.alter_table_sql (cyclomatic 26): DatabaseMethods.alter_table_sql 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":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1942cd8d7417f411553f3bf41598de10666975ecfd6bde2238aa09898ce5e461"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetMethods.eager_graph_association (cyclomatic 26): DatasetMethods.eager_graph_association 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":"lib/sequel/model/associations.rb"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2349a0357b6c1c9d213946a777faf72fee83d4bdc2a0718ec6501c2bf96ff1"}},{"ruleId":"D1","level":"warning","message":{"text":"SequelMethods.convert_input_timestamp (cyclomatic 26): SequelMethods.convert_input_timestamp 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":"lib/sequel/timezones.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce4ce17324b6fa09bca0f62802a0b98fdb12b51dc7561d3a5aa54ee471c4ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"Dataset.function_sql_append (cyclomatic 25): Dataset.function_sql_append 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":"lib/sequel/dataset/sql.rb"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"256721f7ebc2d86856e3b9aca5422d1eed20ccdad205c76018d93fd5c7ba7bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"AssociationReflection.eager_load_results (cyclomatic 25): AssociationReflection.eager_load_results 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":"lib/sequel/model/associations.rb"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2806a83420d8966822435fe536c4def18f756f9ab26058ec8ba95859cce588d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Dataset.window_sql_append (cyclomatic 24): Dataset.window_sql_append 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":"lib/sequel/dataset/sql.rb"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d6eef72b88c8df545b28a36ad585704e9d79a2d14d764990b9d5e29d8d3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"InstanceMethods.check_pg_constraint_error (cyclomatic 23): InstanceMethods.check_pg_constraint_error 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":"lib/sequel/plugins/pg_auto_constraint_validations.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea851f7718ccb062063ec2b510d657633639bb4ca96946efadc7fe898c039a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Dataset.literal_append (cyclomatic 22): Dataset.literal_append has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/sql.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6a9750a3ff8b33c940a963489b75703ec1d0cf7a201802d5639ce202c6bfa9"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.def_pg_array_to_many (cyclomatic 22): ClassMethods.def_pg_array_to_many 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":"lib/sequel/plugins/pg_array_associations.rb"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd54698e0d2df4b2b7b8503ce1935ddf33aa9aba525d86d781a5270d34f441c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Database.connect (cyclomatic 21): Database.connect 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":"lib/sequel/adapters/mysql.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28fbfd4e3d50189650d84eea328f7ca15d78806ed50e10996856ab7d0b92359"}},{"ruleId":"D1","level":"warning","message":{"text":"Database.transaction (cyclomatic 21): Database.transaction 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":"lib/sequel/database/transactions.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"329556c74bce53d731c13d40dcb73e7d618701d25659a80ac1246cf086a2ef6e"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetMethods.date_add_sql_append (cyclomatic 21): DatasetMethods.date_add_sql_append 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":"lib/sequel/extensions/date_arithmetic.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbb0218478c0f1054a4359ac41411e671c1cb9a6dc992997aec8f606076ce00"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetMethods.complex_expression_sql_append (cyclomatic 21): DatasetMethods.complex_expression_sql_append 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":"lib/sequel/model/associations.rb"},"region":{"startLine":3236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c46fd20cbea71417f9b9019aa8b00e8d22e1bb67743d15be4dd01f4695d2f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.constraint_validation_array (cyclomatic 21): ClassMethods.constraint_validation_array 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":"lib/sequel/plugins/constraint_validations.rb"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a65d34939152578d49777377b5b77fb1c2745cde99b6c42ca6522217ae9b85"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods._check_pk_lookup_value (cyclomatic 21): ClassMethods._check_pk_lookup_value 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":"lib/sequel/plugins/primary_key_lookup_check_values.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"91789d9ca4fc321b6f64cfd4e63a13edf19030f24923eeafee35d7065e8dd844"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseMethods.alter_table_sql (cyclomatic 20): DatabaseMethods.alter_table_sql 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":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae5e2a892234d80d8163619a38e1173a3677779dd361e76913372607c754848"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseMethods.duplicate_table (cyclomatic 20): DatabaseMethods.duplicate_table 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":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"151078440ecb8a1084345e38feb140bd0b339b814f77a3e183f08e3e25811593"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.from_value_pair (cyclomatic 20): ClassMethods.from_value_pair 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":"lib/sequel/sql.rb"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"54069c249fbecb954082ca162337a1445b4d1d709b9cca4be2c8eac9da6d0e69"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseMethods.alter_table_sql (cyclomatic 19): DatabaseMethods.alter_table_sql 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":"lib/sequel/adapters/jdbc/h2.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8290577d3c156914c6c342aee84210f8791196957294e4df83946e416ce3f8"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetMethods.string_agg_sql_append (cyclomatic 19): DatasetMethods.string_agg_sql_append 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":"lib/sequel/extensions/string_agg.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f114bf32092374050c0aef012d388959b96e339f50a5b164828620f595724928"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.def_many_to_one (cyclomatic 19): ClassMethods.def_many_to_one 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":"lib/sequel/model/associations.rb"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f693188712b8473298f8e4bc476d849568c82dc28557baba31cb4b2f6b921d"}},{"ruleId":"D1","level":"warning","message":{"text":"InstanceMethods.validate (cyclomatic 19): InstanceMethods.validate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/auto_validations.rb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"96af65dc832c81c5da9197e548b6b99ae18911ff7ccd1a57e3a9cb52eb76ef0a"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.finder (cyclomatic 19): ClassMethods.finder 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":"lib/sequel/plugins/finder.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddc3e193b906b95407d0349b28af072e0e536304241a6d58091f42f10445265"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.validates_length_of (cyclomatic 19): ClassMethods.validates_length_of 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":"lib/sequel/plugins/validation_class_methods.rb"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ca5acb6107ac83080084b5975118d67d1dc963c8a073b6f62027aa7d821684"}},{"ruleId":"D1","level":"warning","message":{"text":"Database._execute (cyclomatic 18): Database._execute has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/mysql.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"545a57f551801f476a7fbef974400c1da9e8aa1e42256c043f23a87f0d605fa4"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseMethods.index_definition_sql (cyclomatic 18): DatabaseMethods.index_definition_sql has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df6007913b167f3c5e082ae4282ce6940ddc093bbdcb5351cc36bed948a2148"}},{"ruleId":"D1","level":"warning","message":{"text":"Dataset.paged_each (cyclomatic 18): Dataset.paged_each 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":"lib/sequel/dataset/actions.rb"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a77a2a63e85412a0ed26fb2b775f2483d61498e207c3bbef9d7faf9d1f886c"}},{"ruleId":"D1","level":"warning","message":{"text":"Database.execute_prepared_statement (cyclomatic 17): Database.execute_prepared_statement has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc.rb"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d42987cc09b566464c0c066ddd1b2473dd5808ea1e979af79d00752e4464de"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetMethods.associated (cyclomatic 17): DatasetMethods.associated 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":"lib/sequel/plugins/dataset_associations.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"08207eec70555cf8656e0b4d0f24935132996d3cbdc75b5df1ab08f5208b1f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"InstanceMethods.nested_attributes_setter (cyclomatic 17): InstanceMethods.nested_attributes_setter 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":"lib/sequel/plugins/nested_attributes.rb"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ea68fa82018eb8c193fe1f087f4d5c022899daf6071b926067def5e4ace40e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.update_unused_associations_data (cyclomatic 17): ClassMethods.update_unused_associations_data 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":"lib/sequel/plugins/unused_associations.rb"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff736eae38c796028dcd1dfd79f3ed88b4cab549c060aae66bd0dba3b28a730"}},{"ruleId":"D1","level":"warning","message":{"text":"Database.connect (cyclomatic 16): Database.connect 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":"lib/sequel/adapters/jdbc.rb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6258c2d1703afbcf97c103329b259c6a302cbde244458da8e878e3b44f6b3148"}},{"ruleId":"D1","level":"warning","message":{"text":"Database._execute (cyclomatic 16): Database._execute has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/mysql2.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6d2334c942024a16748cfc2f8610746738b0be46eb026504840e728b48b599"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetMethods.complex_expression_sql_append (cyclomatic 16): DatasetMethods.complex_expression_sql_append 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":"lib/sequel/adapters/shared/mysql.rb"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f477636a85d473bd6775a7032bfecf721f9c0fd97c9f2c741b010102963cffb"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseMethods.create_function_sql (cyclomatic 16): DatabaseMethods.create_function_sql 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":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae27052869cd1662e2932ddaf65a5b0c94a27ad0cd34521717b7fc6cff6881b"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetMethods.auto_param_type (cyclomatic 16): DatasetMethods.auto_param_type has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_auto_parameterize.rb"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e44ee9cf79ad88113bfecfb43b86022e8b3924747a23892ff716eaae6f0ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoParameterizeInArray._bound_variable_type_for_array (cyclomatic 16): AutoParameterizeInArray._bound_variable_type_for_array 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":"lib/sequel/extensions/pg_auto_parameterize_in_array.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01f964d4309c4d3953bc4c79c35264977d61aff4a44015cc4f46ddfb68f64f"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.call (cyclomatic 16): Parser.call has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_interval.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ac836c2f313842fed086b16d6efa58dc992c9013e48ac28452f7a5c1a3f07"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.def_many_to_pg_array (cyclomatic 16): ClassMethods.def_many_to_pg_array 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":"lib/sequel/plugins/pg_array_associations.rb"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbff132b94bbc5eec9fc46ad75b3d0ef682a7b302c1add776afe9dbb1cc9b41"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMethods.validates_each (cyclomatic 16): ClassMethods.validates_each 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":"lib/sequel/plugins/validation_class_methods.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c410df8894a20bf5ab347d2c45590deb9a19fa435b57ac3bacee07ba7dc46d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"InstanceMethods.from_xml_node (cyclomatic 16): InstanceMethods.from_xml_node 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":"lib/sequel/plugins/xml_serializer.rb"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cd71273c2a801cfc9a9842d6f3ea1457b21150b792db987d6ab2de957f8538"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaDumper.recreate_column (cognitive 68): SchemaDumper.recreate_column has cognitive complexity 68 (threshold 15). Drivers by points: if/else 27 (54 pts), boolean chains 12, ternaries 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/schema_dumper.rb"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c323400b9db380d58b9d700ef01f1c6a8ae8b1096b9e41ace229af71cad598f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.def_many_to_many (cognitive 67): ClassMethods.def_many_to_many has cognitive complexity 67 (threshold 15). Drivers by points: if/else 34 (57 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f88042d26ac3268c73d86dadad8e40b3f3a160ed96734dcce6ef03efd974f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.def_one_to_many (cognitive 63): ClassMethods.def_one_to_many has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (51 pts), boolean chains 9, ternaries 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":"lib/sequel/model/associations.rb"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c853c0dc5ec703c8eda93d90ecf05fdde5f00f3183ad264a3f43e7201320780e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.def_many_through_many (cognitive 56): ClassMethods.def_many_through_many has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (39 pts), boolean chains 9, ternaries 4 (7 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/many_through_many.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"783c03600c9b6fa4c5e10c95dd04a996e2d99922879a2c0a4bf772f7b502ae43"}},{"ruleId":"D2","level":"warning","message":{"text":"RcteTree.apply (cognitive 55): RcteTree.apply has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30 (36 pts), ternaries 9 (14 pts), boolean chains 5 (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":"lib/sequel/plugins/rcte_tree.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe674b6bb98efc6b28a4a2f6e29fb82d6fe26a60b650173f80c6a765455a3327"}},{"ruleId":"D2","level":"warning","message":{"text":"SequelMethods.convert_input_timestamp (cognitive 55): SequelMethods.convert_input_timestamp has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (32 pts), ternaries 3 (12 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 27). 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":"lib/sequel/timezones.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be240ad46476b8bdc9ac66b738623cc35d37440a6d2e9ae59c50c74ff7a75c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.graph (cognitive 53): Dataset.graph has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 13, ternaries 4, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/graph.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeabd3e6681668d4fff829d86cd0c148bf20bbf0fbf0202420fe178b2045e0f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.join_table (cognitive 52): Dataset.join_table has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 11, ternaries 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/query.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"574eec84b49adf4d78f5551e4de7e602246263b29f1bf78431ea2e6239c926dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.complex_expression_sql_append (cognitive 52): Dataset.complex_expression_sql_append has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (41 pts), ternaries 2 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/sql.rb"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a0c4ed3572fe1df934aa2304a2bcef2c5ee0d44fd02ab618e33bab4d38a88c"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.check_pg_constraint_error (cognitive 52): InstanceMethods.check_pg_constraint_error has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (45 pts), error handling 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/pg_auto_constraint_validations.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e27641f17dd74607c0f239314aa4653ed51e25d9d72752efab3b5c45b7282b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.transaction (cognitive 51): Database.transaction has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (44 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/transactions.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"534e99d7dcda2969a8e9719b62a196cc104e291c0965a6b1cc9d651b0b225168"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintValidations.process_generator_validations (cognitive 49): ConstraintValidations.process_generator_validations has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 5, ternaries 1 (2 pts), 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":"lib/sequel/extensions/constraint_validations.rb"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"704ba3e73f5dba40ff66894fbb2486d31852dfceafe9306c5c151f87ea821491"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.complex_expression_sql_append (cognitive 48): DatasetMethods.complex_expression_sql_append has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (39 pts), boolean chains 9 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":3236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2f09d4ed8d5922ee2c7e03e56dcd93538ba393f425c5bbfa00872c31f4e74a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssociationReflection.eager_load_results (cognitive 43): AssociationReflection.eager_load_results has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c55c855c5af92655d04482f9a9f89bd35c304abd8fb359e8a58c48f1ecc2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.window_sql_append (cognitive 42): Dataset.window_sql_append has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/sql.rb"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f4fc0db55587b509723f76fd7cba673c456cc7b8b71143feaf04d010f7e9ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.function_sql_append (cognitive 39): Dataset.function_sql_append has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 5, 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":"lib/sequel/dataset/sql.rb"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1de1c2bf5b6cd05a1eb9f36fce5cb7291f1bccfa7179847d2684b77c23b06b"}},{"ruleId":"D2","level":"warning","message":{"text":"Database._execute (cognitive 36): Database._execute has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (24 pts), error handling 3 (7 pts), loops 2 (4 pts), ternaries 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":"lib/sequel/adapters/mysql.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f94db198d504607d0abce3f8c436086322767cdc40b20a77261d527b756f33"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods._check_pk_lookup_value (cognitive 36): ClassMethods._check_pk_lookup_value has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 4, match/switch 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/primary_key_lookup_check_values.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"08236b19624c808a983e7ecd966b82a051e4f683a771a24b0b5ecd0ff48f4583"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.alter_table_sql (cognitive 35): DatabaseMethods.alter_table_sql has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (3 pts), ternaries 1 (3 pts), 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":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"de279a9e9faff5a28fcf776f528abfbae4f95bc9cf3d87b2632db054546823fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.schema (cognitive 35): Database.schema has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/query.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"45107e6907939b32fec90187f0d88fbca802fa54f3be665ee2e5271ebc708417"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.alter_table_sql (cognitive 34): DatabaseMethods.alter_table_sql has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 3, match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc/h2.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d950afb94df1f39fa9332f88642c9240ca2057c4b6998ce7b3005c5d4950d1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.connect (cognitive 33): Database.connect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 2 (5 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc.rb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a16446c906c7528aa44f22a5de4dc4d2fb3704bf269a07d71dc402a2fdd6bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.def_pg_array_to_many (cognitive 33): ClassMethods.def_pg_array_to_many has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/pg_array_associations.rb"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9b8b0588e68a82e12478fe29ecf6fe6b7368521233f029a3fa6e617db676b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.placeholder_literal_string_sql_append (cognitive 32): Dataset.placeholder_literal_string_sql_append has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/sql.rb"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d456fffa4ccae8eb96bb5374937b19b3c607caf84a7b17ee479b6b7d687d1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.eager_graph_association (cognitive 32): DatasetMethods.eager_graph_association has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 12, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3911e2a38de9c65968093e112dfa68d3fa57027c89c6d1b594257d1251b2bb11"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.finder (cognitive 32): ClassMethods.finder has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/finder.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d876a93bd12e41ecd424f1de8602378e5a9991f50ed8e9cb3521c99dad560f"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.from_json_node (cognitive 32): InstanceMethods.from_json_node has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 2 (8 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/json_serializer.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73795cf6bdec1de1760f66e8b00823b2d8b1c190e6b7882d2bbec1eaac25693"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.associate (cognitive 31): ClassMethods.associate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 10, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1d4d14be41a70d6126d1c8a25d202736b4cbda292f2e6332f3e5a3586a6e40"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.connect (cognitive 29): Database.connect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/mysql.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e841d54810bb5e3ee43e70835d82cebbf5bdea37f9328db26eb7b039fad1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.alter_table_sql (cognitive 28): DatabaseMethods.alter_table_sql has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 4, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"04902e49c4ab40c5f6e5e45e89332548d8a989e5bfb0ee5f1a799c4a316ae360"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.date_add_sql_append (cognitive 28): DatasetMethods.date_add_sql_append has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/date_arithmetic.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"65edd635dc3bbf0a95a872ab2cb577f22e4e100ecb05ccfc846b947f5003b501"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.string_agg_sql_append (cognitive 28): DatasetMethods.string_agg_sql_append has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/string_agg.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8a9b62aec1831cc4c3ff2d9ffd982745b6ef00874be284898aff9297def5ab"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.constraint_definition_sql (cognitive 27): DatabaseMethods.constraint_definition_sql has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), 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":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da73a150782f6b6d982a56f7094b4bcdf78bdfd7e8b9f4e0616cfd4a93e90fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.paged_each (cognitive 27): Dataset.paged_each has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/actions.rb"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"7039a89075193ff9379291c9865ee972376941ecf7c462dbf1f0909662f862e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.first (cognitive 26): Dataset.first has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/actions.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2998789f6cca4de04a9a131130960b8c335a99f00c1e9b1cec9d3811f0d1b256"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.execute_prepared_statement (cognitive 25): Database.execute_prepared_statement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 2, match/switch 1 (2 pts), 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":"lib/sequel/adapters/jdbc.rb"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"69de4431fd996b9eb5c641f1d4cdbb7972f256cba7b09f968bc723b60e5fd25d"}},{"ruleId":"D2","level":"warning","message":{"text":"Database._execute (cognitive 25): Database._execute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (2 pts), boolean chains 1, error handling 1, ternaries 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":"lib/sequel/adapters/mysql2.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3669c06e31b3ea86b11a8c4d6d51bbb93bb737efc917f259d910f2e02bb602"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaDumper.column_schema_to_ruby_type (cognitive 25): SchemaDumper.column_schema_to_ruby_type has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (4 pts), boolean chains 3, 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":"lib/sequel/extensions/schema_dumper.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc9e12d055903b120a2d42e625ac3dd475ce26e49458f93ef918d6562968d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.validates_length_of (cognitive 25): ClassMethods.validates_length_of has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, ternaries 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/validation_class_methods.rb"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"23666dc8f2d398dcfc73f890b44d194af3f1759862781137329b186f595bfd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.complex_expression_sql_append (cognitive 24): DatasetMethods.complex_expression_sql_append has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, ternaries 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mysql.rb"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca329bedd7c6a4591b4b436ea00b9c977d4d1bea55b50cba5935d900db31d18b"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.duplicate_table (cognitive 24): DatabaseMethods.duplicate_table has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d4c5c036b4d05fc486d42cac5902866373d9cba918c7f047901c01233d2fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.connection_pool_class (cognitive 24): ClassMethods.connection_pool_class has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/connection_pool.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8771f09f6c73d380f60d4f51c8216af2751bdafc9671cb4a0cf6bd7e5e1fca09"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.validate (cognitive 24): InstanceMethods.validate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/auto_validations.rb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fbd4073831559d1a1d66dc85ad304010d52f07068bce19c3a5d72bef019015"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.def_many_to_many (cognitive 23): ClassMethods.def_many_to_many has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/association_pks.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6564e4a52bd321b543292f3b7cd457321ac563147982b6538a3a0bc9546e36da"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.to_json (cognitive 23): InstanceMethods.to_json has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/json_serializer.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb7b642c651adfa25ed71507abecaba0f3958f7157e965efb1b58dfb634a4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.from_value_pair (cognitive 23): ClassMethods.from_value_pair has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 1 (3 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/sql.rb"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"08277a136c7337aa82530104b5255c68a5c7eebca016197294dc7e655c8f8696"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.copy_table_sql (cognitive 22): DatabaseMethods.copy_table_sql has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"404cb1441c69fac8e95562c1ae6a37a337de996de87da653c2236851d9472ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.get (cognitive 22): Dataset.get has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/actions.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc0f8b9e53cd7d9ea6da0dae2849fa3db2611f7ce4224df66640d042f791771"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.call (cognitive 22): Parser.call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_interval.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"32437982cb895e6c383a0f48fe663c949525c965a508818c29576dc081bc1f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.prepare_eager_load (cognitive 22): DatasetMethods.prepare_eager_load has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":3793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d377ea9093469f57df50b2501b1d5260e05e79e1b687dddca08c98b4af0487c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.composition (cognitive 22): ClassMethods.composition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/composition.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf070c6c69a4b281e07ac1da4919296afe68182acdec20f09142775c68b0dfce"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleTableInheritance.configure (cognitive 22): SingleTableInheritance.configure has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/single_table_inheritance.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ec68dc29376093e3fad65219ca56f09b04e7cb00ef93710d096a9b0f030009"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.validates_each (cognitive 22): ClassMethods.validates_each has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 8 (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":"lib/sequel/plugins/validation_class_methods.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeb223828180537ef945587e219fa2853fe2d598fb625d3ad924b313457ade7"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.connect (cognitive 21): Database.connect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/postgres.rb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2523e09b39646fdd3d0459b4c17f80580c806eed81e7850b6a45eded01d46e"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.connect (cognitive 21): Database.connect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/sqlanywhere.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbb6a52b7fdd3bd5162d9831487cbab625049c9fe7b0a6ee111049b865057f6"}},{"ruleId":"D2","level":"warning","message":{"text":"EagerGraphLoader._load (cognitive 21): EagerGraphLoader._load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":4117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3057ac414a3852e2de0c6e1125e85da63d9f53809378fd761f0d949a438e06d6"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.nested_attributes_setter (cognitive 21): InstanceMethods.nested_attributes_setter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/sequel/plugins/nested_attributes.rb"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f5457ef5bb9f1600b0083478da11165d1f580a1739f762dc1e92e671215316"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.def_many_to_pg_array (cognitive 21): ClassMethods.def_many_to_pg_array has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/pg_array_associations.rb"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b51a761e578cffd70a8be6d0c2ff639b127f97d18c8d2f4c2b284224dd3d476"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.as_hash (cognitive 21): ClassMethods.as_hash has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/static_cache.rb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cd2c1a3e3a60a5cc0e6adb3b54c58632e453e0659e38896c652d2bbc6c66fc"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedDatasetMethods.as_hash (cognitive 21): CachedDatasetMethods.as_hash has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/subset_static_cache.rb"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2013d4515c12d223cbc226502aa4879f65fd6aa7c7e160874cf81087785a32b5"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.from_xml_node (cognitive 21): InstanceMethods.from_xml_node has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/xml_serializer.rb"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b065cedab31a2a8c06aa4ea8679c7c005a3d79047623ffe712ed046e9401c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.create_table_sql (cognitive 20): Database.create_table_sql has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/schema_methods.rb"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cb55a515b9f93af9ff3c8be43744fccbd85daa3d729d64e127da30d591211d"}},{"ruleId":"D2","level":"warning","message":{"text":"ToDot.v (cognitive 20): ToDot.v has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/to_dot.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b8a46839acfa22fc4528299dde885dceca02c0192fbb5324696138d2a32b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.def_many_to_one (cognitive 20): ClassMethods.def_many_to_one has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 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":"lib/sequel/model/associations.rb"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7448b8f8a8612090c8385266f0b3a613c0839dd0361145552bd6c8f0fb6b5da"}},{"ruleId":"D2","level":"warning","message":{"text":"Plugins.def_sequel_method (cognitive 20): Plugins.def_sequel_method has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/plugins.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5d929cddcfab79779ae8fae0d662adf2d826a3a4de92d385c4a5374f8f846f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.inherited (cognitive 20): ClassMethods.inherited has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/class_table_inheritance.rb"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb71b3725fe1efc529942c8f71fe70d85427c8767cac4e6adcf12bd0d2297a51"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplexExpression.initialize (cognitive 20): ComplexExpression.initialize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/sql.rb"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83e8df0f5723462457b34a7f7fa8d17d055b1a4c647e41f27a7fda415b9e778"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.full_text_search (cognitive 19): DatasetMethods.full_text_search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 2 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4513ae33fb8edf74efa7589ca84ec785c4200a64b9b6e166bdaab92171ae694c"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.complex_expression_sql_append (cognitive 19): DatasetMethods.complex_expression_sql_append has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1c0aba077a597fab200b34c73d4bcc1423d4a3e732afc0ac6bd038cfa5682b"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.remove_transaction (cognitive 19): Database.remove_transaction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/transactions.rb"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7b50a88dbe1c527b8120166d0be119fcc392e9332d67fd58af64f7b05d3594"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtendedDateSupport.to_application_timestamp (cognitive 19): ExtendedDateSupport.to_application_timestamp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_extended_date_support.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41a579b685b295a6142a0152ea828390543959f726b641c871ceb4e8f91ad5f"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.associated (cognitive 19): DatasetMethods.associated has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (5 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/dataset_associations.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ec60f834bbfa1cddfef286a8090917a13149c4085edfd317f084495b82a366"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.update_unused_associations_data (cognitive 19): ClassMethods.update_unused_associations_data has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/unused_associations.rb"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be86d0f64b22ea5e8d092b6f56e25a0d7b2fda512fc06d8129ab72142db6e34"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.select_lock_sql (cognitive 18): DatasetMethods.select_lock_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"94024e532865d5d07b3f7aa29d31050e14ef59d4dcfc9f975bc4a4e4c86c2d60"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.index_definition_sql (cognitive 18): DatabaseMethods.index_definition_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb231b820e236439008602bbf2e3b2ca210ea46dba4a681144509d89de02999"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.rollback_on_exit (cognitive 18): Database.rollback_on_exit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/transactions.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fce461ca6d1b1d5cc1275aa83f2f81705f7d0369bf2e8cfd0e8f4c7060509a"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.as_hash (cognitive 18): Dataset.as_hash has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Dataset.to_hash_groups) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/actions.rb"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cc0069fceae4a0981fdacc0b9a9ed4263ce94e2b9bcbbea43ad2960ba206d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.to_hash_groups (cognitive 18): Dataset.to_hash_groups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Dataset.as_hash) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/actions.rb"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"18427226c1ef83c9558b9843f9a18a39c501bb343416fdc7359341a02bf8771f"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateTableGenerator.dump_constraints (cognitive 18): CreateTableGenerator.dump_constraints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/schema_dumper.rb"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d587294a3ab4ec6ae3ac6218b3f4d7eddb896440a269256b37d093a39d6c38"}},{"ruleId":"D2","level":"warning","message":{"text":"EagerGraphLoader.post_process (cognitive 18): EagerGraphLoader.post_process has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":4210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58e15c90d73e92ee7ddfae0559a4161a880e098403b41e1857031fd57707363"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.plugin (cognitive 18): ClassMethods.plugin has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, 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":"lib/sequel/model/base.rb"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14c322100fd1bfa9500a7bd5c2ebcaa2c8a2a30fbd012501034bbc797175ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.get_db_schema (cognitive 18): ClassMethods.get_db_schema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/base.rb"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f946393464a78bd879fc0998128cbdbfc40b75dd8deea1a2789fd1b524159a"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.lazy_attribute_lookup (cognitive 18): InstanceMethods.lazy_attribute_lookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/lazy_attributes.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"527949c499d9e2596b8eed10725f13e5da34478a0bc56204345df3efae17c3b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ASTTransformer.v (cognitive 17): ASTTransformer.v has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/ast_transformer.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3fbda98fba9ee9165126701205091bf1293010950416e057d153f8d7a9a3de"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoParameterizeDuplicateQueryDetection.detect_duplicate_queries (cognitive 17): AutoParameterizeDuplicateQueryDetection.detect_duplicate_queries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (3 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_auto_parameterize_duplicate_query_detection.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a979d42407911a64299a69581d3f6a89142a333261022e1c326c08af740141b"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.register_multirange_type (cognitive 17): DatabaseMethods.register_multirange_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_multirange.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cb079ea159dfc1ce5a045e8821f652a3cb0b384c273d2031c22ad1b7635dd0"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.register_range_type (cognitive 17): DatabaseMethods.register_range_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_range.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"102692ac7ad7905b83c6f51cdf25fd485575765c21b7565c949a1af35a8b5a04"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateTableGenerator.dump_columns (cognitive 17): CreateTableGenerator.dump_columns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/schema_dumper.rb"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"58760ea29829476ab071d9e50e07276a6da671dc4dba53e2340d0ef0747f4c86"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods.validates_unique (cognitive 17): InstanceMethods.validates_unique has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/validation_helpers.rb"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9ea60438c7915c7c88b85a961658127a3356c59e2a4465f36d4fab5f533249"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.create_table_sql (cognitive 16): DatabaseMethods.create_table_sql has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mysql.rb"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83d90b79eef86c86ce3ad5e3282a3ec2fc79b2745ae24d765b6cfed0547a670"}},{"ruleId":"D2","level":"warning","message":{"text":"CreatePartitionOfTableGenerator.partition_type (cognitive 16): CreatePartitionOfTableGenerator.partition_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b57575dd7e2b74a52994f3638c8cddfe3f057c626f3e8cd57d4ebf6cbc963f"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.alter_table_sql (cognitive 16): DatabaseMethods.alter_table_sql has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). 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":"lib/sequel/adapters/shared/sqlanywhere.rb"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06548c74437355924d564edd1cbf2477f8632ef463a732c02ae132947d721ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.column_schema_integer_min_max_values (cognitive 16): Database.column_schema_integer_min_max_values has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/query.rb"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf23c936da57d40aab6da867f9b7e9efdede9aa6256fc73f6df2eb3438f35df"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataset.add_filter (cognitive 16): Dataset.add_filter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/query.rb"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d6033f76e1832e459bfae1b72f0e485ade110a493f9abae9476f4b9e6d5a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnsIntrospection.probable_columns (cognitive 16): ColumnsIntrospection.probable_columns has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/columns_introspection.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"674f001bed39cd330110278e9ad5570ad5cf8ce524944360e63522578f80f1d9"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseMethods.register_array_type (cognitive 16): DatabaseMethods.register_array_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_array.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe31f29e679ba669c65da02fce4cd3a08582a341dc2ea6aa269f8cc2f2725cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoParameterizeInArray._bound_variable_type_for_array (cognitive 16): AutoParameterizeInArray._bound_variable_type_for_array has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_auto_parameterize_in_array.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c74b1dff2cf24666a3c2d595375bcdb395957d3fca49bffc30ca6dfb30d77b3"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethods._save (cognitive 16): InstanceMethods._save has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/base.rb"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa901b04e0be217e07ef8799f8b9d4c134ca4cfbe667ee0d2b2beaf1e8a9d5d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetMethods.to_json (cognitive 16): DatasetMethods.to_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/json_serializer.rb"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878c42e360ed4e45f2892cae73ee19cb549db9deda93972fed938ac4d87e5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedDatasetMethods.to_hash_groups (cognitive 16): CachedDatasetMethods.to_hash_groups has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/subset_static_cache.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"892594034a675578d0f54634bb3f257308b1ca53ee6a5e10ac1be9594d2eb668"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/associations.rb: FileTooLong \u2014 2562 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2062 over it, 5.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77189a93b08e90a1ee43febab6c626b3e6aecd404baff85281d99b024641c09a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dataset: TooManyMethods \u2014 149 methods. The bar is 30 methods; this is 119 over it, 4.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/sql.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"992405debe8349916091313944e443347e57a3e885fd11c909adcbfc725609d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseMethods: TooManyMethods \u2014 137 methods. The bar is 30 methods; this is 107 over it, 4.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a11c56e61e8166cace56eab0ac9a23d440c8dea4d647d1898cb4725692d759"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/postgres.rb: FileTooLong \u2014 1995 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1495 over it, 3.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25df4761d9cfd2f34d06784a08ed7450c5af7be4c039d8e6e36d8b32d876ec2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Database: TooManyMethods \u2014 113 methods. The bar is 30 methods; this is 83 over it, 3.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/schema_methods.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc809c3bbbb1e350f5f3db52531c3345c1ffb492fc0bf6811d0ad4d2ef9c630"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InstanceMethods: TooManyMethods \u2014 93 methods. The bar is 30 methods; this is 63 over it, 3.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/base.rb"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7934e7d8825491bb2a08b64fcbde43abd9e746cd81f3d917983720fe59bcc184"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatasetMethods: TooManyMethods \u2014 88 methods. The bar is 30 methods; this is 58 over it, 2.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f08e9180bedf630f80392fc46c5f86924dd8ad651b1015994ccefbf0dfa10b6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AssociationReflection: TooManyMethods \u2014 88 methods. The bar is 30 methods; this is 58 over it, 2.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faa02a4f7b815c6fd9d14e76f2545a606685027d3cad466b9ca6e89814e9e54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataset/sql.rb: FileTooLong \u2014 1437 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 937 over it, 2.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/sql.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce3c3e1c11f053fb97d207764814afc0ffe940ae558a6054b771891ac8f517b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatasetMethods: TooManyMethods \u2014 81 methods. The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"631022949338964efe9a58bff6497cbc4b88e0d2a27ae8fbd6dcb134ec9b1487"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dataset: TooManyMethods \u2014 80 methods. The bar is 30 methods; this is 50 over it, 2.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/query.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"961d2001ca1d37eb2719600f7a0436f6b27ff9357848abc3b6160a86c9f51311"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dataset: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/actions.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb8fae4d9f6610a385adc0377932cd621f84c5372e2250403fb967aba04de9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/base.rb: FileTooLong \u2014 1212 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 712 over it, 2.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/base.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df99724f921f482451614307e1de2a03c3ac4f2f6994fa9d54346db79a82f65"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassMethods: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/base.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b84a9b0e3d9fd2f4f021b0cb8d9572234cb1b2d4ceb677ccf9e765d0f3c773"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sequel/sql.rb: FileTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 508 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/sql.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fb24cc287a3ad65e8d1cfbcac17c6ef2d9546b04e79fa19eb6921b23aa5654"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseMethods: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mysql.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13dd08a84cf1e80f6ce8b47f6248d749fc954ce4b66dcaeb762d5d2be1412f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatasetMethods: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mysql.rb"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"6501c75bde480175104f2aa6da7d13dcc5a62b9b7fb9b77bd1fa7bf2dd41a273"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatasetMethods: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c42d39e9d729c64a3786dc2b594a80e4a76f814f74c70415b7ca923017edc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/mssql.rb: FileTooLong \u2014 867 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 367 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6d0c85fb63884c4d0527c5c7c5778613cf87b142a3fc04af9442168b9de015"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/mysql.rb: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 297 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mysql.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6dae12b18fa3aafab265f1f8ddbf532443601de15f0c013ece70dbb290a226"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Database: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a780ba898c9b80cb6cc8d2744ab4eca273336d016c8779682832dfac7c0cacd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatasetMethods: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/oracle.rb"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d41e1e86938602e530fba9d19561199f24f90af0aac729fe4e8c7234f0b6041"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Database: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/misc.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7494ccfd414164a1e2f581a6b82e429c5e6a4507379fdab45e138506b7d847"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseMethods: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c6e8d60c18ba418704a6ec66f5f6c721553d99b8be91e484d5f21a479ecf47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ManyToManyAssociationReflection: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f442e9cc424ddee2ba41de324c53932d9ec444d70473481ceb4a4d217a035f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/sqlite.rb: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 235 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e831c192b36e4d7d288fe216a99de5444ca947365aefecc48fd4addfdd1b93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataset/query.rb: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/query.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f51502ed10533c840975e028d083f8af6f0f2f28c4076b73841f782651e42ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extensions/pg_json_ops.rb: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_json_ops.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ff16aa672bb970256c91e18e6c01681894b2d3aace2fa6101333146f721b31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/jdbc.rb: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb9b0bce2769ce6106ba41e637eb03b8080e88d675cca1dfe7e427da737cee7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/schema_methods.rb: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 147 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/schema_methods.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"681c8f3eafd451b0a67abbca773974415bdcde78b3650d902f1bd1bb2ce157cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseMethods: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf86a11d0ed7d27121329a539a842110c889c70f4bb7ff898182eb56cd0c0e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataset/actions.rb: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/actions.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"277a1ed1d2e94b508afbcd27fff9bf9434f3e569d27b2f37fb405f7511ec5400"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Database: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/transactions.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c03f9392aa354ad72f6ef4a7495625e2264dbe69d13b9b44233a981b8a061c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseMethods: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/oracle.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4278744781bbc27fb258be08153f13a80358485a7ec20a9d30a356b6e6bfc06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/oracle.rb: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/oracle.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a85a47dfb11d9ef323ee2a6d99782bbee2e41abf80a55928d3fd63a5a18279d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/postgres.rb: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/postgres.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93af7f2c8abf477e3eb21cade85b8a9694aae35088d5faf779de745860f20816"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dataset: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/misc.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b42066f13d81cc0b45217826f7aece1610c7aebf1dcf6e7a17e580177a367c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OneToManyAssociationReflection: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60056436c9da369cb027227936498418fe0956db2514f5708dbe77cf837794"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InstanceMethods: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3641577ca319ff9357ac4ad2ec299bc3394fc05dbe47b12f6856c44271e8e376"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArrayOp: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_array_ops.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"82131c4f119070e37b3b8af856eeb408095e9e7f713c8ebfd08de617c40addb2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JSONBOp: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_json_ops.rb"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"17eb80c7a2391a5e5648e2cd37f4428c039fadbe4a3de4f71469467b012d013e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/sequel/plugins/static_cache.rb:199-219 | lib/sequel/plugins/subset_static_cache.rb:251-273 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/static_cache.rb"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"61243aeb329b6a1cfdcabcd139e0ce409830b022d326366c78f5a7eb37847018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/sequel/plugins/static_cache.rb:148-176 | lib/sequel/plugins/subset_static_cache.rb:196-226 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/static_cache.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c981a9313184dabf50ef67758739489f3becf13a6f672eaeb313f154d340f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): lib/sequel/model/associations.rb:2361-2385 | lib/sequel/plugins/many_through_many.rb:360-384 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ee1d50e8d87e8f34f118851ab260f23f7411a9aefb89e640419483e8bb93aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/sequel/plugins/pg_array_associations.rb:366-385 | lib/sequel/plugins/pg_array_associations.rb:468-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/pg_array_associations.rb"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae91bdf66b3beb624acdbd4d74bcacdd6a0d850e7efc02d9ef70a817279aa310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/sequel/plugins/static_cache.rb:153-171 | lib/sequel/plugins/subset_static_cache.rb:203-221 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/static_cache.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5482cf9c244b8835871af98ceca92940da92f04a0e053113781171e93e3a721f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/sequel/adapters/shared/postgres.rb:2825-2841 | lib/sequel/adapters/shared/sqlite.rb:956-972 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/postgres.rb"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"74004873ee1ca82bf372d2e87900e50b4f2005db6c2fa1a248b7930c8b7d1a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/sequel/plugins/pg_array_associations.rb:349-364 | lib/sequel/plugins/pg_array_associations.rb:451-466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/pg_array_associations.rb"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1de69d43ed79a86607882fb749d77f48bbf6752ae57a48e753202b91095dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/sequel/plugins/static_cache.rb:199-214 | lib/sequel/plugins/subset_static_cache.rb:253-268 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/static_cache.rb"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c235e377562c2d946274d48b05afca479ba48184e305f5461a82648df9e95c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/sequel/extensions/pg_json_ops.rb:977-990 | lib/sequel/extensions/pg_json_ops.rb:1248-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_json_ops.rb"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"56028d41224dc547bdbf3850e67b20cf097e9d2c36183925cb8c71d43c454aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/sequel/plugins/rcte_tree.rb:139-150 | lib/sequel/plugins/rcte_tree.rb: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/rcte_tree.rb"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ba4060e809dd9a65e9f654bbccf234ff02220123f27c7cc2c458cc8182081b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/sequel/plugins/rcte_tree.rb:182-193 | lib/sequel/plugins/rcte_tree.rb:283-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/rcte_tree.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71fdfd71eeebc3e1030d39c215613ca2a8e8de37f21e5ce6ea4b0dcd5cabc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/sequel/plugins/association_multi_add_remove.rb:52-58 | lib/sequel/plugins/association_multi_add_remove.rb:63-69 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/association_multi_add_remove.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2fd998fd3355793a7cbe5600b77ab8c450f9fe5de61528bdc9363cfedc4b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/sequel/extensions/pg_multirange.rb:144-148 | lib/sequel/extensions/pg_range.rb:157-161 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_multirange.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed31b4d03dbd2e2716fbc4f1fde99a6816e1302888c16c2469f16a8ec022221a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/sequel/adapters/amalgalite.rb:93-106 | lib/sequel/adapters/sqlite.rb:94-107 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/amalgalite.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f742c6454ad1c526c27d66aad1ca7eaa820ffdb24121a1d817085dec07bc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lib/sequel/adapters/jdbc/db2.rb:53-58 | lib/sequel/adapters/jdbc/derby.rb:139-144 | lib/sequel/adapters/jdbc/hsqldb.rb:101-106 | lib/sequel/adapters/jdbc/sqlanywhere.rb:45-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc/db2.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"139be2a48b0c1b807ec6926d03696eb7f7a36b471226a27aa9f064431b05e1c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/sequel/adapters/jdbc/derby.rb:164-174 | lib/sequel/adapters/jdbc/hsqldb.rb:118-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc/derby.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f593be827107397ca5bc055fcfc134c7074ca0b0b5b10fd29bee5e3dfc450b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lib/sequel/adapters/shared/db2.rb:399-408 | lib/sequel/adapters/shared/mssql.rb:924-933 | lib/sequel/adapters/shared/oracle.rb:559-568 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/sequel/adapters/shared/db2.rb:399\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/db2.rb"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a552bc3f6bbaf05960c1e19db2b8c4f945b545a1f41fb5aa40bbfde5b2fe469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/sequel/adapters/utils/columns_limit_1.rb:11-18 | lib/sequel/dataset/actions.rb:106-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/utils/columns_limit_1.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"485b16fcf726fc7d39068d43502ac9c6af0fd2c3e7df3708ef3c4d45a7dfa720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/sequel/extensions/pg_hstore_ops.rb:299-308 | lib/sequel/extensions/pg_json_ops.rb:847-857 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_hstore_ops.rb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8c28f3e877d9969a22709d57f12045c28f31e47dcd32d00b8352141c2ebf71"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 22): Database\u0027s methods fall into 22 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/mysql.rb"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d2dea34a5e6d455a62b618d31d16eeb3ffef484c0983eefed4823448cd9267"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 21): Database\u0027s methods fall into 21 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/mysql2.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"73576decd6003bb9feb874f362a54a34c39e0effec7b1bb7a502d1440e860591"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 20): Database\u0027s methods fall into 20 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 20 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/trilogy.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fe85bf039896eb7d147583cee6e3086f4ad0b2ee16a25ac38d55bda59f2d60"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 15): Database\u0027s methods fall into 15 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/ibmdb.rb"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dff90bef1e6946e50f2d5fe9020257de7a3640719857ab8b30a2c89b1c7fcdc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 15): Database\u0027s methods fall into 15 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/sqlite.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcc42f9f7f693650fdd10ea26bf663298283e77e87750e7beff95231738889c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Dataset (LCOM4 15): Dataset\u0027s methods fall into 15 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/dataset/sql.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64f038723dc1674c892bbbd2b985b0bfee31b6be6ef1e6a863257b547b16cd8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 14): Database\u0027s methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/oracle.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9585fd2b90d6b44c2286c22da6f0711810b5418ad0e8c8195f06410934b6be53"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 13): Database\u0027s methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/amalgalite.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fca136c613fc8936abd9022fcbb28ebd59348d3ecea45af7aafb8cf8442321f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Database (LCOM4 11): Database\u0027s methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/schema_methods.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b8079875adc6577310ecb20db08e403c3339b4ea1eb388b981dc30808f26ea"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TimestampMigrator (LCOM4 4): TimestampMigrator\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/migration.rb"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"8364e7a5b01d90baaa16c5a2c1d4554c9e28cd1e9893c72546fa7a89719bca27"}},{"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":"b67792e0f592c9ae470a7dc5aad08c8c7cbefc5aab36146d9a86e497252710e6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/sequel/plugins/pg_auto_constraint_validations.rb: lib/sequel/plugins/pg_auto_constraint_validations.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in InstanceMethods.check_pg_constraint_error at line 237. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 17:54:41 -07:00\u0027 --until=\u00272026-10-22 17:54:41 -07:00\u0027 --full-history --no-merges -- lib/sequel/plugins/pg_auto_constraint_validations.rb\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/pg_auto_constraint_validations.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee9119fdf985455f2bba8371024e89860e19567b771d03fa36a129c98896dcc"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (67396 LoC, 1346 module-visible types across 14 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f27785e5d32b999b72807ef88edf21f69ff79b11646f22bda6bfe29d2126e22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"627cd96a7046f245d65f18d7e05b99d1f87061f181b98f7a8389c3ca61c32f02"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe3d278e6c0273eef239da7e0c959946c89f3c0f7c91a5c33875be21c7610e6f"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d53b0941dfb4465ce8e8a2a8d7febc73f35f4e33888a892c70b22f3c63fe8526"},"taxa":[{"id":"CWE-561","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":"c049ba6dc65aaa5f5be520aa4444e9e72b4770781937ad74f423577fad4157f5"},"taxa":[{"id":"CWE-561","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":"0492f909b4dec04163966ce73bae72df571ac97bc65434fabc59486f75719d2a"},"taxa":[{"id":"CWE-561","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":"c40f75a5566de57b386def3246e81ff1593e766869cbaee8f050f62d8a1ee493"},"taxa":[{"id":"CWE-561","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":"c2d403eee9a66bed9eefe80d5e58f66c16c52cfd8e32e657089ea6555c54ca6d"},"taxa":[{"id":"CWE-561","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":"f716de3948b58bac3ec199adb2c6f11de36690ae2079361765c6e0d519ef6940"},"taxa":[{"id":"CWE-561","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":"f4b328910510c15ad691fa2d28c9c858bfe4a4c4e746b2c1433f5e4bce095fc5"},"taxa":[{"id":"CWE-1265","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":"3be80bcecbde7829b9ac43735a4c99341a82c6325ebfa92c1436dc73d9a9daec"},"taxa":[{"id":"CWE-1265","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":"e0c6c2b12d6bbf414e132249f84b10be6a7d23c3ef1d12995c2024042caafd7d"},"taxa":[{"id":"CWE-1265","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":"4c416f9cfa3cf5392a31e533e84d48d6dfa8390025e8f9f92f88c85c5a6232a5"},"taxa":[{"id":"CWE-1265","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":"bdccdebba3202f6250e2f8120de229a1ee6c567991ce808c93cf5ddb4f24ae67"},"taxa":[{"id":"CWE-1265","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":"b9336ade9da04b40c792577d384a218ca2b41515ebf2735179308983836e4553"},"taxa":[{"id":"CWE-1265","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":"f4ecf840a325c566b119816d4b0cb21f9b484d36b0d360ccacada48b13417932"},"taxa":[{"id":"CWE-1265","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":"f26a06b32cc2e9fffa7737aa768b32efb5579c603ffab67f7e9703576f1a9a3f"},"taxa":[{"id":"CWE-1265","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":"7b09d88db7d2d963c61c433f7c8b9d62d1713b4589598dac9434ff59a4bb7ba0"},"taxa":[{"id":"CWE-1265","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":"1a66876a57e79b11925f96e88ae123e2132a8c5989d74a20b252a50e0d5326e5"},"taxa":[{"id":"CWE-1265","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":"b56b2f4fb4de9d0900828d35b115c9ac458846a13a60fd732ad4b4be3abfb7a0"},"taxa":[{"id":"CWE-1265","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":"6cabc8ac1d9f20e8e2fbfbe054d824080b431417ca9c022777ff064cfaab4982"},"taxa":[{"id":"CWE-1265","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":"b93fc0f2db508a42fe404d6c757f5be82e85a6381c0408246150fe0483234cca"},"taxa":[{"id":"CWE-1265","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":"54ed970cebfff742b5f17ae1981402af73efb303fcf87a6fc68665f2581ef4bc"},"taxa":[{"id":"CWE-390","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c09f68cdfef61dc91d3847c6bf1f8d17b5b04d7c3a397238aaaed3fc1b190b0"},"taxa":[{"id":"CWE-1265","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":"a3f485ad3e02f83f8bd38ed8320ed3bb6ed0e567436bf73790cda0b852511896"},"taxa":[{"id":"CWE-185","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":"f4b6581ae898d56fb26c9fb2beed233327ec62d853ac3c7ce1641e1f70191c7c"},"taxa":[{"id":"CWE-185","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":"35bee64df3b79c13e046c15039b4c18be6a85b79c85abd903609490c04a7774c"},"taxa":[{"id":"CWE-185","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 220 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 220 of the 313 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: lib/sequel/extensions/index_caching.rb. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/index_caching.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"047151b39a0d2cbfb089c39cb47fbc80432e71cce038a42e1ff0c8069a2d937e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/layout.html.erb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4afeaf30e1db0f0ae4ba4c408aa983c9ce52103a06bfb2d57a37c996b6ddbc5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/layout.html.erb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f0332fa5e7468ee0b9259844934f31aac7ea7b091df3285dc5dbf79834eb28"}},{"ruleId":"AC3","level":"warning","message":{"text":"Multiple navigation landmarks without distinguishing labels: With more than one navigation landmark, each needs an aria-label/aria-labelledby (e.g. \u0022Primary\u0022, \u0022Footer\u0022) so assistive tech can tell them apart. At least one nav here is unlabelled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/layout.html.erb"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eeaf474144183196449cbc4bfed06c9c7730861a5920ec64a871887d8fc952"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/layout.html.erb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eb26fc463c9800b82bc53817cdf959dc0116e59fef7f0422906b9891b06f1c"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over your pages. Add an accessibility checker (axe-core, pa11y or Lighthouse) over your HTML in CI and fail the build on new violations. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spec/extensions/pg_auto_parameterize_spec.rb"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8b9ad24c994459deb51d930d532780ac875a860dd61f52c4e522be0a8a33b5"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add brakeman for Rails apps, otherwise \u0060semgrep --config=auto\u0060 or CodeQL\u0027s ruby pack as a CI step. What was searched, so you can tell an absence from a miss: the 2456 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@opts[:append_sql] || @opts[:placeholder_literalizer]\u0060 appears character-identically in 2 files \u2014 lib/sequel/extensions/provenance.rb, lib/sequel/extensions/sql_comments.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/provenance.rb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"503b07050967e0bcfafd1aaee800da3327c289b4c741f6498b3d60b4de4d6999"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@opts[:database] == \u0027:memory:\u0027 || blank_object?(@opts[:database])\u0060 appears character-identically in 2 files \u2014 lib/sequel/adapters/amalgalite.rb, lib/sequel/adapters/sqlite.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/amalgalite.rb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3dd8ea4b4b96e05f213a6667b5f1c4034da70fc5ee82afb373016e55edf71e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@opts[:skip_limit_check] \u0026\u0026 type != :truncate\u0060 appears character-identically in 2 files \u2014 lib/sequel/adapters/shared/mssql.rb, lib/sequel/dataset/sql.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a13df1599658c85c49c6dff1e781711bd1fbfd439ea24f33a06036360fef06a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060associated_class.primary_key || raise(Error, \u0022no primary key specified for #{associated_class.inspect}\u0022)\u0060 appears character-identically in 2 files \u2014 lib/sequel/model/associations.rb, lib/sequel/plugins/pg_array_associations.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa79536d0cc7edf1c12e98ff1d3bddc206e86b603cd36a30705af1c9f639462"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_a?(Array) \u0026\u0026 !Sequel.condition_specifier?(c)\u0060 appears character-identically in 2 files \u2014 lib/sequel/model/associations.rb, lib/sequel/plugins/rcte_tree.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/associations.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c5df0bcef75a77d2a6c6e369867482a389ecf10d9a580bff96a52816a05ea2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060convert_smallint_to_bool \u0026\u0026 db_type =~ /smallint/i\u0060 appears character-identically in 2 files \u2014 lib/sequel/adapters/ibmdb.rb, lib/sequel/adapters/shared/sqlanywhere.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/ibmdb.rb"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceaa4ca388a1462d13fb37566a5d836834e4b3a2e7641edb3c183b742a95ecc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060convert_tinyint_to_bool \u0026\u0026 db_type.start_with?(\u0022tinyint(1)\u0022)\u0060 appears character-identically in 2 files \u2014 lib/sequel/adapters/mysql.rb, lib/sequel/adapters/mysql2.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/mysql.rb"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb6039667a22786b696b4d2ea7f5345b8ae56540155ce9bb3b6969fd441b0b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index[:name] || default_index_name(table_name, index[:columns])\u0060 appears character-identically in 2 files \u2014 lib/sequel/adapters/shared/mssql.rb, lib/sequel/database/schema_methods.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a12c5683118327bca5a2467ebec4c15d1046002d01aadff7a8fed33075b8ad0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index[:where] \u0026\u0026 !supports_partial_indexes?\u0060 appears character-identically in 2 files \u2014 lib/sequel/adapters/shared/mssql.rb, lib/sequel/database/schema_methods.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282317f6be12ad26be2aa31654454bbfa8e3efb97a684a03452f7c381b4e3bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.start_with?(SEQUEL_LIB_PATH, RUBY_STDLIB, INTERNAL) || (ignore \u0026\u0026 line =~ ignore)\u0060 appears character-identically in 2 files \u2014 lib/sequel/extensions/caller_logging.rb, lib/sequel/extensions/provenance.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/caller_logging.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5fc3076fc6f12a7539a66d274346078c242f155117934658116699180531e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060primary_key \u0026\u0026 model.restrict_primary_key?\u0060 appears character-identically in 2 files \u2014 lib/sequel/model/base.rb, lib/sequel/plugins/blacklist_security.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/model/base.rb"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd84b9d0c6960c774e4c9c70fe64099ad285d186248166f0d0880f58ec8b7b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060respond_to?(:register_array_type) \u0026\u0026 defined?(PGArray::Creator)\u0060 appears character-identically in 2 files \u2014 lib/sequel/extensions/pg_multirange.rb, lib/sequel/extensions/pg_range.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_multirange.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c590a25889d541d0559074a874145d92d51425d6aee7c2e77a662f4713420b0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060server_version \u0026\u0026 server_version \u003E= 140000\u0060 appears character-identically in 2 files \u2014 lib/sequel/extensions/pg_hstore_ops.rb, lib/sequel/extensions/pg_json_ops.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/pg_hstore_ops.rb"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"179ff8fd3531ccabb01ba10ca10f9c53f0324ae9bb64b5a245503f1710bc3df5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060transform\u0060 is public, takes a document from its caller (line 11) and hands it to \u0060v\u0060, which walks \u0060o\u0060 as a \u0060Hash\u0060 and calls itself at line 24 (\u0060self.v\u0060) with a piece of \u0060o\u0060 (and at line 27, line 30, line 33, line 35, line 38, line 40, line 42, line 44, line 46, line 48, line 49, line 52, line 56, line 58, line 60, line 63, line 64, line 69, line 72, line 76, line 78, line 80, line 84) \u2014 and nowhere in \u0060v\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060v\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/ast_transformer.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4a9e29567b5689ea5d138b40221cfd27a649ce855c0ca16c39453a471911ec"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 37) and hands it to \u0060v\u0060, which walks \u0060e\u0060 as a \u0060Hash\u0060 and calls itself at line 80 (\u0060self.v\u0060) with a piece of \u0060e\u0060 (and at line 85, line 90, line 95, line 99, line 102, line 103, line 106, line 109, line 110, line 111, line 114, line 115, line 116, line 119, line 120, line 124, line 126, line 127, line 130, line 131, line 134, line 139, line 148, line 150, line 152, line 158) \u2014 and nowhere in \u0060v\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060v\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/to_dot.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c8f58cf3e037c2bf2ae5bb07472ba8de0ea35cd6d4f981c550d0596c328b94"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060output\u0060 is public and takes \u0060values\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 739 (\u0060self.output\u0060) with a piece of \u0060values\u0060 \u2014 and nowhere in \u0060output\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060output\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a94ec09a16937717042ae5292b5a12ca21f827ab679a759269474a1b824a2ca"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Dir.new\u0060 is called here without a block, so it hands back an open descriptor the caller must close \u2014 and its first and only use reads \u0060.each\u0060 through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for \u0060IO.popen\u0060), \u0060Errno::EMFILE\u0060 under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (\u0060Dir.new(\u2026) { |io| \u2026 }\u0060), or the one-call reader/writer (\u0060File.read\u0060, \u0060File.write\u0060, \u0060File.foreach\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/migration.rb"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"185566855cdc1f473a89c48a21d835a154d38510a98cdc696162e8072a82173e"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Dir.new\u0060 is called here without a block, so it hands back an open descriptor the caller must close \u2014 and its first and only use reads \u0060.each\u0060 through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for \u0060IO.popen\u0060), \u0060Errno::EMFILE\u0060 under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (\u0060Dir.new(\u2026) { |io| \u2026 }\u0060), or the one-call reader/writer (\u0060File.read\u0060, \u0060File.write\u0060, \u0060File.foreach\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/migration.rb"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc82370a3a96f0201710a16339d8a2d1a0f7bcd0bac5e0aa5ebfb3c37af08d26"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Dir.new\u0060 is called here without a block, so it hands back an open descriptor the caller must close \u2014 and its first and only use reads \u0060.each\u0060 through it and drops it. Nothing closes it: it stays open until the garbage collector happens to finalize it, which is one leaked descriptor per call (a child process too, for \u0060IO.popen\u0060), \u0060Errno::EMFILE\u0060 under load, and for a written file data that is not flushed when the program next reads it. Use the block form, which closes on every path including a raise (\u0060Dir.new(\u2026) { |io| \u2026 }\u0060), or the one-call reader/writer (\u0060File.read\u0060, \u0060File.write\u0060, \u0060File.foreach\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/extensions/migration.rb"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf3a1ab3bff6f47636b5497c284e55202ee9ad86b33a96411ede72eb1a4755"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/caching.rb"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb372001dcb5686eec7b91d8a15b1189a487172a3fd0c75fe889682e22c9eec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/plugins/single_table_inheritance.rb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c190959a5fdccdbac71ce2c59dd90bbc6e061a1cd60a05b68ab2e76677bf6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/query.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dcc585c367ce94566256b47f82872737d566bc6e4129f2f67eded05bf9297b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/database/transactions.rb"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"749dd5fa13d26c83b37417e7b0396019df205ada4ebe2adb876063472abc9e99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c27c3713d4e302c0d7152ace488b684e388f184bca379177072540335c58710"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/postgres.rb"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"aace12c767152b265b3ada108d5ddde5c0cda08d63cf6f79c3cfcd0fadf5afec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue s\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/sqlite.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"593cbfedfad472d7eb4ca922aba6bd048933d2e403ef6ac1654cdbb6736abdc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/mssql.rb"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c850f4e6a4a10b228d623b1596dc97a4c5ded6a8346c1c834b1d7d3c3cb565"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/oracle.rb"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ff4dbf2a222e9b1bd64ac58adce2cbb7ef7a1796c9ca7b0c3dcc25e5bae2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/shared/sqlite.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7719a9cbbde04ad8b1e05ad0de0c670336a4f030298d9ebad9c7a86f08cec4a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc/h2.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e40053eb24b8540095638814bd4a284d06c30dc1af1088892495c6b8a75987"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/jdbc/mssql.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a9147a088a6b1af48ab6ef4275c8da077586b092e2c640284f15993190214"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sequel/adapters/ado/access.rb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"167ff3de6b36958b4852cda2960ad61be06c098399729aea506912305ba1fb35"}},{"ruleId":"X5","level":"note","message":{"text":"Ruby\u0027s type checker does not check nil everywhere: This repository commits no Sorbet configuration (\u0060sorbet/config\u0060) and no \u0060Steepfile\u0060, so nothing type-checks its 312 Ruby product file(s): a nilable value reaches a method call silently and raises \u0060NoMethodError: undefined method \u2026 for nil\u0060 the first time it is nil. A \u0060# typed:\u0060 sigil does nothing without a \u0060sorbet/config\u0060 beside the code; a Steep run configured only on a command line is not something this check can read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"32b27113b1bc22f400935e8620d19eae7fd3ef145cc36018609c445ea8cd4af1"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Ruby code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/make_guides.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"87343c6bbc00e86616a4a30191fa6041bb300173e13aa747b4394fa3731ccbd5"}}],"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-1265","guid":"9bfc5711-f2f2-6252-bd2e-ff21a1e98a6c","name":"CWE-1265","shortDescription":{"text":"CWE-1265"},"helpUri":"https://cwe.mitre.org/data/definitions/1265.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-185","guid":"ced1612b-cee6-0c5d-aef4-559c3fddbde0","name":"CWE-185","shortDescription":{"text":"CWE-185"},"helpUri":"https://cwe.mitre.org/data/definitions/185.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-390","guid":"7484c168-de95-2c52-afd2-197fb3efb184","name":"Detection of Error Condition Without Action","shortDescription":{"text":"Detection of Error Condition Without Action"},"helpUri":"https://cwe.mitre.org/data/definitions/390.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-561","guid":"522a7ba7-45e9-ab53-9088-45d86e04b53a","name":"CWE-561","shortDescription":{"text":"CWE-561"},"helpUri":"https://cwe.mitre.org/data/definitions/561.html"},{"id":"CWE-755","guid":"ac8136dd-f77c-1c5e-bdcc-3905bbad9bd9","name":"Improper Handling of Exceptional Conditions","shortDescription":{"text":"Improper Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/755.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]}],"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":29,"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."]}]}