{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"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":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"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":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"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":"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":"TypeConstruction.synthesize (cyclomatic 376): TypeConstruction.synthesize has cyclomatic complexity 376 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"87438be94e3bdaf57591c46dc8a762a79dc1500d3cc0740e30920273cd4b11f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Check.check_type0 (cyclomatic 91): Check.check_type0 has cyclomatic complexity 91 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdce71417c8b665130d6232cba789a8a8cc3023bfd24a5423e63a83648eb5e5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.try_method_type (cyclomatic 74): TypeConstruction.try_method_type has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3984}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc6316282d87f8a8d8d33bba7e935d8e4693e47fd918d4b4221e672f4be740f"}},{"ruleId":"D1","level":"warning","message":{"text":"PositionalParams.merge_for_overload (cyclomatic 59): PositionalParams.merge_for_overload has cyclomatic complexity 59 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"61692f4d92134630ecff121bfcf8cd1fd6ee7ef67d13d51debf09dc189f7100a"}},{"ruleId":"D1","level":"warning","message":{"text":"PositionalParams.merge_for_union (cyclomatic 59): PositionalParams.merge_for_union has cyclomatic complexity 59 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c861e9066aa1cf3f706c87880b2e51f85f0465605d637338c5f5f4325e36cb83"}},{"ruleId":"D1","level":"warning","message":{"text":"Master.process_message_from_client (cyclomatic 57): Master.process_message_from_client has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8915d9256c94649261f3b516da558a47aecac23ef31dda2348248447e5e7cc5a"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodParams.build (cyclomatic 55): MethodParams.build has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/method_params.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b229821ac47537906db3e7462841d97c89bd61e48748c7fcc65ed383f20dc7"}},{"ruleId":"D1","level":"warning","message":{"text":"PositionalParams.merge_for_intersection (cyclomatic 51): PositionalParams.merge_for_intersection has cyclomatic complexity 51 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8882e273004e483345150dd47493c2b88ec6fb9fa9d0bf63e9cd62d8bee8550"}},{"ruleId":"D1","level":"warning","message":{"text":"Inline.find0 (cyclomatic 46): Inline.find0 has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/locator.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee10c8da1eef0f67e4d63856095102a93b6079dd70b6b7f5d33fc9c1e82f1961"}},{"ruleId":"D1","level":"warning","message":{"text":"Source.construct_mapping (cyclomatic 45): Source.construct_mapping has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/source.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6077ebf32865c6dc657d1cff7e90b38df5735f4450683fa690254bec047b017"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicTypeInterpreter.evaluate_method_call (cyclomatic 44): LogicTypeInterpreter.evaluate_method_call has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a578c5538715a28a47e44877b6a55e7a9596b688026ded044ae16a969313e0"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.type_send_interface (cyclomatic 42): TypeConstruction.type_send_interface has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"809abe371e164b11634eff247de942c650548bb477ce797953af964b0110e1b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Source.insert_type_node (cyclomatic 40): Source.insert_type_node has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/source.rb"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72841ef323fc270a6a31f84c63672402c6a09e985efe594f3f3ddc04d09dc52"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicTypeInterpreter.evaluate_node (cyclomatic 40): LogicTypeInterpreter.evaluate_node has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"348c95bc1fc1cdd099f0c96df69385d9fb247fa5c4500f163eb1047bdee8b804"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationParser.parse (cyclomatic 38): AnnotationParser.parse has cyclomatic complexity 38 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/annotation_parser.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d76283cb87d0f58c5e0d0d5bdb2f367d0faeb7b213280ce5c98bfcb4774940"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruby.items_for_trigger (cyclomatic 38): Ruby.items_for_trigger has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/completion_provider/ruby.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"345110c929535b8e296c75f90ccbc8be1e9f2ddf7c278cab7bca3b397f819451"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruby.content_for (cyclomatic 35): Ruby.content_for 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/steep/services/hover_provider/ruby.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89e499ae8baf0eb76266636aac930caedea0b6030b38e483b216aa1de9bfc95"}},{"ruleId":"D1","level":"warning","message":{"text":"Inline.inline_result (cyclomatic 34): Inline.inline_result 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/steep/locator.rb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab680e5173a5b5ac9a4a60f35d99291deb3055426fbd35a52ad4d4668dc2b83"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator.validate_one_class_decl (cyclomatic 34): Validator.validate_one_class_decl 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/steep/signature/validator.rb"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420b6125e7a1f19e9230ad943590508227e574906d889903a2e9c4bce4df00b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.for_new_method (cyclomatic 34): TypeConstruction.for_new_method 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68a7365417c29a8fb3fca10c9c70ef67eb08c15652e3ec4d4509eb43b5c3b26"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockParams.params_type0 (cyclomatic 32): BlockParams.params_type0 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/steep/type_inference/block_params.rb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"af022b24fc0011d1671a5abe772d6ab6f1c78f89d66f44153c2b881f9ad5fd96"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.for_block (cyclomatic 31): TypeConstruction.for_block 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba5f282317072e672bbef328d2c1cee36d805d795ab8243ce88ce476bf56f97"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.raw_shape (cyclomatic 28): Builder.raw_shape has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/builder.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0817bc9d4f0c4d4b395e20593810b7a9bfdad5c334cebc6f10c600e8940a108"}},{"ruleId":"D1","level":"warning","message":{"text":"SignatureHelpProvider.active_parameter_for (cyclomatic 28): SignatureHelpProvider.active_parameter_for has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/signature_help_provider.rb"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be563da6067a8a77540cb36e13b97a06605286401a9f6f0f9d9504036a1de85"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.run (cyclomatic 27): Server.run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/daemon/server.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9abf63e7fddc66be7ffe22e2a2c00426dcd3e006347ffb0ffda80f731686d0"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolProvider.ruby_symbols (cyclomatic 27): SymbolProvider.ruby_symbols has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/symbol_provider.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c0b16e69bfc0a7ad98b91cca7006fce667ee92eed2e1eff482949f347b6f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Check.check_type (cyclomatic 27): Check.check_type has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b713d08b10a4cb26fbbcfc703cfa3212bdf4d6f6dbe1ec2bfa7e1644234115"}},{"ruleId":"D1","level":"warning","message":{"text":"PositionalArgs.next (cyclomatic 27): PositionalArgs.next has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/send_args.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e91a396aa0179a2cd832d3b54ef03365270bfb50e169a9ef054c6883add3fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"SendArgs.each (cyclomatic 27): SendArgs.each has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/send_args.rb"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"558c146c036c00633f613fb001d7f389866c4dcf6515b6fba7e2e56a105edf2c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.validate_method_definitions (cyclomatic 25): TypeConstruction.validate_method_definitions has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":4789}}}],"partialFingerprints":{"codehealthFindingId/v1":"447b38646672b913f82d76cd86abb6f82175969bb9c36a4f6e7860511126765e"}},{"ruleId":"D1","level":"warning","message":{"text":"RBS.content_for (cyclomatic 24): RBS.content_for 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/steep/services/hover_provider/rbs.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"308f152817280991779e3d928a554f31bfcbb08dcde03076962616b0e0172009"}},{"ruleId":"D1","level":"warning","message":{"text":"Check.check_generic_method_type (cyclomatic 24): Check.check_generic_method_type has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"681e1daa58ebbe5ee37ab2ceae872072685e3f5349a4beafe82e1e2e4fc37934"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockParams.zip (cyclomatic 24): BlockParams.zip 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/steep/type_inference/block_params.rb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"09be9a1faa37e7db2a740aed6664f050cc9670620f7b96a7c21637d63d0efde6"}},{"ruleId":"D1","level":"warning","message":{"text":"Check.match_params (cyclomatic 23): Check.match_params 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/steep/subtyping/check.rb"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90059dcb29da2da66fa2fab105a1425fa81dde686fae0cdd02bb49c95aee534"}},{"ruleId":"D1","level":"warning","message":{"text":"Checkfile.run (cyclomatic 22): Checkfile.run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/checkfile.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fea343544e3c5cb9a033e80f4cc0b1c6074706027593728e4ef4b75a17ddfb"}},{"ruleId":"D1","level":"warning","message":{"text":"LSPFormatter.format_hover_content (cyclomatic 22): LSPFormatter.format_hover_content 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/steep/server/lsp_formatter.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d001988dec9b2fcc449091353428aae3a2a6366bb831236116961469929910"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodType.try_type_params (cyclomatic 21): MethodType.try_type_params 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/steep/interface/method_type.rb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"355a0c6ac660c95ee3bd3cc153f7a891d2e506930869e86083d3f314786f78c9"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodType.| (cyclomatic 21): MethodType.| has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/method_type.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab034a4d3568f600c7cd010b7e5b728b6e8fa23b871d8e830f2e959d0315114"}},{"ruleId":"D1","level":"warning","message":{"text":"LSPFormatter.completion_item (cyclomatic 21): LSPFormatter.completion_item 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/steep/server/lsp_formatter.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceec42d30f6ad85e7b2a34cbc5f192526638a9226f5c071c9079ef8ae4e803c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Master.start (cyclomatic 21): Master.start has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"041e09124b104627e9cf61d7d11b5b5aeda7a4678eab7f48fa34fc005b9f2fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCheckService.validate_signature (cyclomatic 21): TypeCheckService.validate_signature has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/type_check_service.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d0db8255e894b6b0dc6d31d0b23a5e166544e55549043c13ca4830ef038ad5"}},{"ruleId":"D1","level":"warning","message":{"text":"RBSEntryBuilder.members (cyclomatic 20): RBSEntryBuilder.members 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/steep/server/rbs_entry_builder.rb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e19e356bf10fae40958bad54d24c6a757717059b6bf2ac9cb1aba64ab78f6a"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.type_check_args (cyclomatic 20): TypeConstruction.type_check_args has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb61555fb247c19420bab3f843eb5b9b05b758108e74280563184e402ca71cd"}},{"ruleId":"D1","level":"warning","message":{"text":"KeywordParams.\u002B (cyclomatic 19): KeywordParams.\u002B has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (KeywordParams.|) 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/steep/interface/function.rb"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd53aa1142d61673b138867f67e2a32ecaa10795295499b56923dd39bec0a8cb"}},{"ruleId":"D1","level":"warning","message":{"text":"KeywordParams.| (cyclomatic 19): KeywordParams.| has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (KeywordParams.\u002B) 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/steep/interface/function.rb"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a273b81b0e507d0a73f86e8e82b83375e8c616f4a96e1692bb9be245e6596b5"}},{"ruleId":"D1","level":"warning","message":{"text":"KeywordParams.\u0026 (cyclomatic 18): KeywordParams.\u0026 has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcacf0926585f06230852537ccdff3d4f13e214e543a38728f06c221c0cea93e"}},{"ruleId":"D1","level":"warning","message":{"text":"Master.start_type_check (cyclomatic 18): Master.start_type_check 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/steep/server/master.rb"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7f70d077b22b2251ee64650ab6e66755fff7d7d319db9f5ab8347d89e9512f"}},{"ruleId":"D1","level":"warning","message":{"text":"Master.sync_project_files_from_disk (cyclomatic 18): Master.sync_project_files_from_disk has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac76d572a7a7cafc47c2f86fb24cb20be0c135373bb96c25b7f1e5ada2fd5d54"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.synthesize_constant (cyclomatic 18): TypeConstruction.synthesize_constant has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"319a73e80f021637f9a408251ae48b2ddc65cbc46e2f64f171b16e76f45daef8"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.type_lambda (cyclomatic 18): TypeConstruction.type_lambda has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd23ae5135b5f87e44f97cb073be8ea4b1aa19777617147a31f61935ce8395a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.type_hash (cyclomatic 18): TypeConstruction.type_hash has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":5212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abed369afff4412f6dfbfb3f14cd7b9c13405108e0d0633737c37f22c66ec70"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicTypeInterpreter.literal_var_type_case_select (cyclomatic 18): LogicTypeInterpreter.literal_var_type_case_select has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89ebab25b7bfc4ef4d38d1f780670d723ae2b47b495af0d72426a351419c5fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.replace_primitive_method (cyclomatic 17): Builder.replace_primitive_method has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/builder.rb"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"8547c970681a25f48561384ba73728e405339c0c40329216f1b477baccf98718"}},{"ruleId":"D1","level":"warning","message":{"text":"GotoResolver.parse_name (cyclomatic 17): GotoResolver.parse_name has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/goto_resolver.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c213bbb4bf598f51d771da7d7c3d9206672028ab39fad030dde92884acca4271"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCheckWorker.handle_job (cyclomatic 17): TypeCheckWorker.handle_job has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/type_check_worker.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a03f1a6bba2e4593d7f08b32e7bda2a871f9ec8235fc50b3b08bc4ff04044f"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruby.keyword_argument_items_for_method (cyclomatic 17): Ruby.keyword_argument_items_for_method 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/steep/services/completion_provider/ruby.rb"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c39cd692a9d1873a644c8e872bc2193d250111e2716472527e8f40a47c6d99"}},{"ruleId":"D1","level":"warning","message":{"text":"Ignore.parse (cyclomatic 16): Ignore.parse 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/steep/ast/ignore.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba683bac4c795ee1529af73113e7d2408ab0d0625e250ed15c19e803dd5e33a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Watch.run (cyclomatic 16): Watch.run 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/steep/drivers/watch.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdca43920417ede7aa5a01976eb6506e22004ed8da5460ab730ef7b7f90b881b"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruby.method_items_for_receiver_type (cyclomatic 16): Ruby.method_items_for_receiver_type 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/steep/services/completion_provider/ruby.rb"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"112704320d513dadf035c4a5177fbfc414d755c69a12c740c53ce6c66d2d00ce"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeConstruction.type_masgn (cyclomatic 16): TypeConstruction.type_masgn has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/steep/type_construction.rb holds 11 of the 60 methods over the threshold \u2014 including the worst \u2014 and 507 of the 1251 points over it (41%), 3.8\u00D7 the next-largest file (lib/steep/interface/function.rb at 135). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e942b8399b567e0a4b461cae5061cd646a9ed4c89c4aa8b22013237782f9abe"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.synthesize (cognitive 741): TypeConstruction.synthesize has cognitive complexity 741 (threshold 15). Drivers by points: if/else 268 (612 pts), match/switch 23 (64 pts), boolean chains 52, ternaries 3 (10 pts), error handling 2 (3 pts) (nesting depth added 393). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9785f875f925e782a6baeabef5bacdcffbb657e94d3db7ef98fc6edbbb9b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.try_method_type (cognitive 213): TypeConstruction.try_method_type has cognitive complexity 213 (threshold 15). Drivers by points: if/else 60 (182 pts), boolean chains 16, match/switch 4 (15 pts) (nesting depth added 133). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3984}}}],"partialFingerprints":{"codehealthFindingId/v1":"19da6c82842b92bc3349ed997b2e4f91dc4d32f024382d39e5f5560572dfad4f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_send_interface (cognitive 106): TypeConstruction.type_send_interface has cognitive complexity 106 (threshold 15). Drivers by points: if/else 30 (89 pts), boolean chains 11, match/switch 2 (6 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4b25e8a45633808c5f2e5a3390657529ed83216bed446daf09aba24c4d1466"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicTypeInterpreter.evaluate_method_call (cognitive 98): LogicTypeInterpreter.evaluate_method_call has cognitive complexity 98 (threshold 15). Drivers by points: if/else 23 (71 pts), ternaries 4 (16 pts), boolean chains 10, match/switch 1 (nesting depth added 60). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"680b869d13e9290017ef497ce91d31fbb083867f9a1aad7640e4749f057d390b"}},{"ruleId":"D2","level":"warning","message":{"text":"Check.check_type0 (cognitive 85): Check.check_type0 has cognitive complexity 85 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 30, ternaries 4 (9 pts), match/switch 4 (8 pts) (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"443cbb3d877a2c13597af9b25c5b3684e377017ffb5d35df6dbbf0e94815bf41"}},{"ruleId":"D2","level":"warning","message":{"text":"Inline.find0 (cognitive 83): Inline.find0 has cognitive complexity 83 (threshold 15). Drivers by points: if/else 21 (65 pts), boolean chains 12, match/switch 3 (6 pts) (nesting depth added 47). 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/steep/locator.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f555a61a398d106cb73bdf4bedf806cf870ed174dc359dbc7acdbf04c0fbde15"}},{"ruleId":"D2","level":"warning","message":{"text":"Master.process_message_from_client (cognitive 79): Master.process_message_from_client has cognitive complexity 79 (threshold 15). Drivers by points: if/else 28 (59 pts), match/switch 6 (14 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 40). 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/steep/server/master.rb"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4897ab09b8cbac766ba8de224c62b035ee268fd81d0d900a310d55dc28a52c"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicTypeInterpreter.evaluate_node (cognitive 75): LogicTypeInterpreter.evaluate_node has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (60 pts), boolean chains 12, match/switch 2 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f7a0e98c5c4aab23ec6be46ed4d0fbccafd5382c355536ea749a69dfdd8ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"Source.construct_mapping (cognitive 68): Source.construct_mapping has cognitive complexity 68 (threshold 15). Drivers by points: if/else 22 (49 pts), boolean chains 17, match/switch 2 (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/steep/source.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62bd4c7ea375526e3e5657b415658d2f26fd8bf6d382a57a066ea973bf50060"}},{"ruleId":"D2","level":"warning","message":{"text":"SendArgs.each (cognitive 68): SendArgs.each has cognitive complexity 68 (threshold 15). Drivers by points: match/switch 8 (33 pts), if/else 14 (30 pts), loops 2 (5 pts) (nesting depth added 44). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/steep/type_inference/send_args.rb"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"249875ffac6056a9a801b0a89dbe635233a6e7cf7d6dbd689578435c29657c65"}},{"ruleId":"D2","level":"warning","message":{"text":"Source.insert_type_node (cognitive 61): Source.insert_type_node has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (42 pts), match/switch 4 (10 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/source.rb"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"642f60ee4afec23e313f58e6ad0c9196f1d47ecc57bfc06c69163d613fc9b65e"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruby.content_for (cognitive 57): Ruby.content_for has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (33 pts), boolean chains 13, match/switch 4 (9 pts), error handling 1 (2 pts) (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/steep/services/hover_provider/ruby.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac45e6e72d46d3ed4122448c6107cb653fc67db66099b2c0a214c8acf81cd580"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.active_parameter_for (cognitive 57): SignatureHelpProvider.active_parameter_for has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (43 pts), match/switch 4 (11 pts), boolean chains 2, ternaries 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/signature_help_provider.rb"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"542a7f886f4d9b0ec79d01d4d91c2bddf18047be13a680a09384eaa9fd5d8d39"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodParams.build (cognitive 54): MethodParams.build has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (27 pts), match/switch 9 (15 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/method_params.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d202d2baa35e56d4bca30e7ce8101d8b7d65c6ae9a5ee2ececf4459ba3ed6ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolProvider.ruby_symbols (cognitive 53): SymbolProvider.ruby_symbols has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 4 (13 pts), boolean chains 8 (nesting depth added 31). 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/steep/services/symbol_provider.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4deb0ab7387cf8871cfc8b2c6554295189ad611b76ea22fb8b91c0fa948149e"}},{"ruleId":"D2","level":"warning","message":{"text":"Inline.inline_result (cognitive 50): Inline.inline_result has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (40 pts), boolean chains 9, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/locator.rb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9603b434c2b52ad65aa84deb4be17c507d36d38872c94910b9e8af5ab39ee3c"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockParams.zip (cognitive 50): BlockParams.zip has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/block_params.rb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"213f68613f07112a9bfd8fbd900f2adddafd68fce5fa4eea0dda95a534fa126e"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockParams.params_type0 (cognitive 48): BlockParams.params_type0 has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 17, match/switch 2 (4 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/steep/type_inference/block_params.rb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"007062f8cd9253d617f0cc68073ba1192ba97f80d45e8d2c85f65057d0c55db3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.synthesize_constant (cognitive 47): TypeConstruction.synthesize_constant has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"8054b3d19c8edade55eade47237b8c1a69cbd39491ba62743f481ffaaa47990e"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validate_one_class_decl (cognitive 44): Validator.validate_one_class_decl has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 9, match/switch 5 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/signature/validator.rb"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1856ebcc9cea9de5799a1550274035eda1d2a3fe1f65c931a262609dd9a3eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Check.match_params (cognitive 43): Check.match_params has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 3 (6 pts), boolean chains 5, 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/steep/subtyping/check.rb"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9121461870e0f4bbe843be3b9f78350315426963a2d0eaea0a97f8349d8def1"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionalParams.merge_for_overload (cognitive 41): PositionalParams.merge_for_overload has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 40, match/switch 1. 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/steep/interface/function.rb"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f10f8fa6457efa0cc4d7a11c3c0a8cb3310290d458d683e734eb19a44215580"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionalParams.merge_for_union (cognitive 41): PositionalParams.merge_for_union has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 40, match/switch 1. 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/steep/interface/function.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbd8402904ae449c55560fedc9abf49da364bc67e3df6a5febf10426214c758"}},{"ruleId":"D2","level":"warning","message":{"text":"Check.check_type (cognitive 40): Check.check_type has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 3 (11 pts), boolean chains 7, match/switch 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2854af97005a36cceeaac3a6d3dde23da59c0e4c2567c8b047b314bcb9a70981"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruby.items_for_trigger (cognitive 39): Ruby.items_for_trigger has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 20, if/else 8 (10 pts), match/switch 5 (9 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/completion_provider/ruby.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f462f972294c33b69605bfc67ad37a8a39e79263bdfaad27c7aa5cebbfaf38bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.synthesize_constant_decl (cognitive 36): TypeConstruction.synthesize_constant_decl has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6b34d194d3fc1bcbdb71f775b2214c1138cdce7f8fb998146530a8998488a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruby.method_items_for_receiver_type (cognitive 35): Ruby.method_items_for_receiver_type has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 1 (5 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/completion_provider/ruby.rb"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d7d29e88284325b265b6165f9e8776bad9b389ddc8a4d5a9c01a339c7cbe8b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.for_new_method (cognitive 35): TypeConstruction.for_new_method has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 8, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2814ca59fe7e14ffa13299b108f92699940e0ee4d979989f64a5c880e4420c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.for_block (cognitive 35): TypeConstruction.for_block has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 11, match/switch 3 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"374a6c01c05611fa2f7fac158112e5c51c08a38ec57c9ada67f289d716944321"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionalParams.merge_for_intersection (cognitive 33): PositionalParams.merge_for_intersection has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 32, match/switch 1. 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/steep/interface/function.rb"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7054a3d9665db476c812c84b2433ac561be862c595dcaf795761243e63a4a6be"}},{"ruleId":"D2","level":"warning","message":{"text":"Master.start (cognitive 33): Master.start has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (11 pts), boolean chains 5, loops 3, error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"694768ef48a5e6b131744ecb6cbf2882024e6e5685f3ab18632e13966f32fed5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_lambda (cognitive 33): TypeConstruction.type_lambda has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (9 pts), boolean chains 6 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754627b9c35db2eed092922eec046f07c1b1da9a318391b103102a913284127"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodType.try_type_params (cognitive 32): MethodType.try_type_params has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 7, match/switch 2 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/method_type.rb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"742271870f828ea9ba08bfca713b471564b221e5777b931e64bbbec57389e928"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.run (cognitive 30): Server.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 7 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/daemon/server.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50ee95df7fc2a6735797922f237920617dd2d3aef9d6dc71409540632b00be5"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.replace_primitive_method (cognitive 29): Builder.replace_primitive_method has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (20 pts), if/else 3 (9 pts) (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/builder.rb"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f9c10083bd53b60dc17af2a039b91d257529e9850761587b299adce4339957"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruby.keyword_argument_items_for_method (cognitive 29): Ruby.keyword_argument_items_for_method has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 5, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/completion_provider/ruby.rb"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f27484191f710729dfc317716f22b881eea366e4780f6976874122a81a765a"}},{"ruleId":"D2","level":"warning","message":{"text":"LSPFormatter.format_hover_content (cognitive 28): LSPFormatter.format_hover_content has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 2 (4 pts), match/switch 2 (3 pts), boolean chains 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/steep/server/lsp_formatter.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ab912d8889472d31b939a52210a7bcc573c06a8b916fc70b7cc55ad1d98ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraints.solution (cognitive 28): Constraints.solution has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 1 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/constraints.rb"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28b6dee7d8b2dced7954f80256ed23e430721d5587f71d76e0cba222be49bea"}},{"ruleId":"D2","level":"warning","message":{"text":"Check.check_generic_method_type (cognitive 27): Check.check_generic_method_type has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 11, match/switch 2 (3 pts) (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/steep/subtyping/check.rb"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"02945a870e9c5221ca7e8fe753b3a3110ac7b0e1bd10a3764141d925e6db3e27"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationParser.parse (cognitive 26): AnnotationParser.parse has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 21, match/switch 2 (3 pts), error handling 1, if/else 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/annotation_parser.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"898474965b355d06d5ef222d4b3158ed1ac3b1b94e6e8cfa8cb156bca91e5fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicTypeInterpreter.literal_var_type_case_select (cognitive 26): LogicTypeInterpreter.literal_var_type_case_select has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62eace797ca6fe8adfa03abfa1e0f5498dbc513bd2747e0fa04346806a3e7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.run (cognitive 25): SignatureHelpProvider.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 8, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/signature_help_provider.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ac527ed09a186dd65e4f38cca60970b680f0d6bfc5bee0f6cd8e3728639a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Source.skip_arg_assertions (cognitive 25): Source.skip_arg_assertions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 2 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/source.rb"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f37321d29001e2bb7de5c7f8db7171f0643df18ade70b49ec43fbf7ac41c89e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.validate_method_definitions (cognitive 25): TypeConstruction.validate_method_definitions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, match/switch 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":4789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d36151336d3f6405f7c2e7fec235f77046a60a57f81ac4ed7692474e8d7a7b6"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_hash (cognitive 24): TypeConstruction.type_hash has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":5212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9838da8ff8edd82ee8b9fcba533fd3ffd3b3cfdc654c5236e2387c1b0c9b3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodType.| (cognitive 23): MethodType.| has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (9 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/method_type.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7514982b0ae0851c96e4c6298196fd3ddd4e59aee217ee510527b905e8103147"}},{"ruleId":"D2","level":"warning","message":{"text":"Master.on_type_check_update (cognitive 23): Master.on_type_check_update has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ae641cda3e5ae61304b86c3b93111f203b583ae2bd67b391544bdd9216a305"}},{"ruleId":"D2","level":"warning","message":{"text":"LSPFormatter.completion_item (cognitive 22): LSPFormatter.completion_item has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (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/steep/server/lsp_formatter.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"825b1ce9d3fbc2a004fbe3a923a2567cc9d64f2f98552e97f41372ba924ad0d3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCheckService.validate_signature (cognitive 22): TypeCheckService.validate_signature has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, match/switch 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/steep/services/type_check_service.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b99968c524ec373c1258999107db1c24cdcaa3220ac64589173d075aa84a10"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkfile.run (cognitive 21): Checkfile.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, match/switch 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/checkfile.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a957f5fcda92a4e217928ce663b4cdc4da8ec645865bd46379b82ff1e4726261"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_check_args (cognitive 21): TypeConstruction.type_check_args has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b42279d36b8f9ac64d70e90031f280f4d846bb9b289938ca008f95848c11f2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_hash_record (cognitive 21): TypeConstruction.type_hash_record has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":5151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0e6841eda1b2a7f32d962fabcbb4f694c40abeb522f2437cf5690246ca972c"}},{"ruleId":"D2","level":"warning","message":{"text":"KeywordArgs.next (cognitive 21): KeywordArgs.next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/send_args.rb"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e408db091a1171349c15aa82c9d23d39b53c491553fc77718eabaf8d1cfdf183"}},{"ruleId":"D2","level":"warning","message":{"text":"Master.start_type_check (cognitive 20): Master.start_type_check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, 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/steep/server/master.rb"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b3faa51b543da6c3accc4399d1afe163a34e56916ef48542ae5fdb94f6eb90"}},{"ruleId":"D2","level":"warning","message":{"text":"GotoResolver.parse_name (cognitive 19): GotoResolver.parse_name has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/goto_resolver.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43d7792b3126b3b25316efd414add4560f8fb8ea25b8304c9d74ef1393a7c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"RBSEntryBuilder.members (cognitive 19): RBSEntryBuilder.members has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/rbs_entry_builder.rb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f19aaa48e2fbf334458f41dc435867c7a5212a028550ece0734ef7392d8ced"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeNameItem.comments (cognitive 19): TypeNameItem.comments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/completion_provider.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"76321a4336b3a57e8423000389cfbf9ec37ca08663336dd5f256f649cc9d777a"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.signature_help_for (cognitive 19): SignatureHelpProvider.signature_help_for has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (17 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/steep/services/signature_help_provider.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a5475e87127a6427e93381d7832fd70f42a725f7e8f91376f5941bb64bd67e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_send (cognitive 19): TypeConstruction.type_send has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"45116c1a13f678a51b1cda1d8138499bdfd27ead568a3ea58254a6f0e55d8630"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon.status (cognitive 18): Daemon.status has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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/steep/daemon.rb"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dee4f804c4d005fb8d944b05d9cb4d948fa2df997a5bb2e8142332c0715b80"}},{"ruleId":"D2","level":"warning","message":{"text":"KeywordParams.\u002B (cognitive 18): KeywordParams.\u002B has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 7, boolean chains 2 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (KeywordParams.|) 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/steep/interface/function.rb"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4deec1d8a77b28854b325469c4a21b4ed23a3e62eb2f8d63d28ce012c788eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"KeywordParams.| (cognitive 18): KeywordParams.| has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 7, boolean chains 2 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (KeywordParams.\u002B) 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/steep/interface/function.rb"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"340427d3d0d830686020afddcbf03268d309da86b2f19e67d30e134c7863515b"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorContext.set_body_context (cognitive 18): CursorContext.set_body_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (7 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/typing.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb17a7ded20a8a52f1f77964e49df4d1b5625fea4beb1abbd6c06b8e5095f4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch.run (cognitive 17): Watch.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/watch.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d881889fed1de0643f03039f12f19ad3d6aaf4c6f43ce0f2cc51a827615e4ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.raw_shape (cognitive 17): Builder.raw_shape has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/builder.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bb4cf476328e580703aa869ce1106d427a4bfaaf14a8aebf4c174658032d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"KeywordParams.\u0026 (cognitive 17): KeywordParams.\u0026 has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 7, boolean chains 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9610b0a16ab2a1607a195df1054a244eef4fa5939755b9b6976e7c23b83c53"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodType.\u0026 (cognitive 17): MethodType.\u0026 has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 5, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/method_type.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3e074071b827309688a2ffa4ec6fe20b18a3028c75a5ae576058e0e82e0ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"LSPFormatter.type_name_comments (cognitive 17): LSPFormatter.type_name_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/lsp_formatter.rb"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"df65b71050b78e3366b36432794b4d6790aa1dada133ba9d0c406acaec21cffc"}},{"ruleId":"D2","level":"warning","message":{"text":"FileLoader.each_path_in_patterns (cognitive 17): FileLoader.each_path_in_patterns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/file_loader.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab47b098ec63076530569663940b7d16c42ee01949287bc0e12ab064174eb94"}},{"ruleId":"D2","level":"warning","message":{"text":"RBS.content_for (cognitive 17): RBS.content_for has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (8 pts), match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/hover_provider/rbs.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acee6af3d2502c4616c23d3c9ecc0f76c31b6e7f4ee4def8b8e0a683d8787e6"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_masgn (cognitive 17): TypeConstruction.type_masgn has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), match/switch 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb099846cdb1493a740e4f7085a4760231c033856782855f6f658c724fcf5fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationsHelper.deprecated_type_name? (cognitive 16): AnnotationsHelper.deprecated_type_name? has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/annotations_helper.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef936d8d4628f51ba84122ed12b926366c329b7713c31ed3e70f9580fbb3aae5"}},{"ruleId":"D2","level":"warning","message":{"text":"Ignore.parse (cognitive 16): Ignore.parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/ast/ignore.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"da037c1b423857675c514bc5507125d2d6cd8c531d493399afd203c230ad0b96"}},{"ruleId":"D2","level":"warning","message":{"text":"Factory.partition_union (cognitive 16): Factory.partition_union has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/ast/types/factory.rb"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"698f33d7ef193e991c3b95ba39537e3d8eb9128f403170ad1097151f146986fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Inline.type_name_result (cognitive 16): Inline.type_name_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/locator.rb"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"612f7ff3f067e904678f2469cfa927e66e7b3472ce9b07de10fd0759dfc92ded"}},{"ruleId":"D2","level":"warning","message":{"text":"Master.sync_project_files_from_disk (cognitive 16): Master.sync_project_files_from_disk has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 5, error handling 1 (2 pts), match/switch 2, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b12beb9d849823d533dca6e11d63d4ad24b9671686c9feff7c93cc2a027f9e1"}},{"ruleId":"D2","level":"warning","message":{"text":"RBS.run (cognitive 16): RBS.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/completion_provider/rbs.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6951abeed89bc1938ec2231398ea13ca217da61be3779f4f9f8030bbc195edd"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceFile.diagnostics (cognitive 16): SourceFile.diagnostics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 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/steep/services/type_check_service.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45cec13f33ecc3b7b21e81354f639101f094ad74ba82ca42102069c6a13ed26"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.for_sclass (cognitive 16): TypeConstruction.for_sclass has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, match/switch 4 (5 pts) (nesting depth added 1). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"631f906d0e4a767ae114134395b28b831f859be3661095601cc9e19ee5de82ff"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeConstruction.type_masgn_type (cognitive 16): TypeConstruction.type_masgn_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/steep/type_construction.rb holds 16 of the 80 methods over the threshold \u2014 including the worst \u2014 and 1165 of the 2376 points over it (49%), 7.6\u00D7 the next-largest file (lib/steep/type_inference/logic_type_interpreter.rb at 154). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"623324791fface944d6c31e6b79173220dcc75e10e6c33b5eb0b044dc73447d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: steep/type_construction.rb: FileTooLong \u2014 4269 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3769 over it, 8.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5831f8be0b758b83d3652f2aa199b82728b625486b5fc28183ec53bd6627e1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeConstruction: TooManyMethods \u2014 100 methods. The bar is 30 methods; this is 70 over it, 3.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4236cf55579169fba9e5a24b4535b9fabccaf7cfa51bb61e0f08d2f8aea9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/master.rb: FileTooLong \u2014 1352 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 852 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffba8dc794fa253a476d48d78316fd0333e7cf22f29d06acd988a9fa3af7a116"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostic/ruby.rb: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 577 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/diagnostic/ruby.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbe8f638f9b5dd45decffe5d0ba055fdfc24060eeb8692861e2cdf8be8291fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Master: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4befaeea56bd63bdaf38a48194d8969b6b1256aef4b2bf6e168ee0a6b11b7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subtyping/check.rb: FileTooLong \u2014 965 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 465 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1ffef145ad9c5c3f242db9f2d7e0499cd451e262c8e547a4dcd54c4a37109a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interface/function.rb: FileTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 386 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e201e5d36e81a068ef7a00d1cb35b5ebe2319c5cae3ff1de0385235465f170"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interface/builder.rb: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 339 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/builder.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"311021f43f49a863286cac5d72a33382d338e7d57b51d6e034fb1e0c4ae4c7f9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Check: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the 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/steep/subtyping/check.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ac9882d5c8f4a1993bcbe1f04aebc69901d3edf754cf1eccb0ecc5e4559957"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/lsp_formatter.rb: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 114 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/lsp_formatter.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b468a51717b0eceeab6725d2045bb6f482e9c8471e1a5860d90f7fa497594320"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Validator: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/signature/validator.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"34667dca0e4b8801585775da4cfe5a2f8636a6b66dfbaaac523120ef132c4290"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: steep/cli.rb: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 93 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/cli.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5241d4e9426a6f1cd084a571630501915f02400220c65fb742c85d5571f0733e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: signature/validator.rb: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/signature/validator.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9da6e9a5f6f9ab5db2e71b00bc7428518a5bfe2ee44d007877193042aca985e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: steep/source.rb: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.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/steep/source.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7363e8f2200b8f4dd3abf3d47c94c52b0605c3d2b57442442a138f807c0077"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/send_args.rb: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/send_args.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f5ac04997f2d8bb7b4f8378935851d71d9fb7897880e00f6081eda886f8b32"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Params: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee6030556f20d86cea904fd3f29c1cab7ffbf10c4a21a7b2142fcf53f6e3589"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostic/signature.rb: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 42 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/diagnostic/signature.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4302c4b65cbafad365a860bdceca84f24a75788f8e3ce6561b159bcf230c7a06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: 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/steep/interface/builder.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c8e51c899f5b9543714932ea4a896fb2017810764340363a233d7f6b2b8b50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/logic_type_interpreter.rb: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8375f8a1c06410cb0c1352aaec9238702ea766eec944d0c8f456cdc5f7235"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion_provider/ruby.rb: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/services/completion_provider/ruby.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee6e67eb67a3207a6267d49c0d2429943832a80b37f9df456bfc47cb0972fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/steep/drivers/stats.rb:119-196 | lib/steep/drivers/watch.rb:29-193 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/stats.rb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab56ab793cb5f35bfd64d0cf01e57929f7dc7fce4667338e45fa19adc4334e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): lib/steep/signature/validator.rb:369-390 | lib/steep/signature/validator.rb:484-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/signature/validator.rb"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a76055310ebd336f3979d758b7203f318abc7db4e3ee2f31943d5fa65a77eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 2): lib/steep/server/worker_process.rb:45-65 | lib/steep/server/worker_process.rb:107-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/worker_process.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd107099498b0f856b0e42f0089f55080aab5e74bf7d697d649fd0e784976de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/steep/server/lsp_formatter.rb:293-311 | lib/steep/server/lsp_formatter.rb:364-382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/lsp_formatter.rb"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e49182b2aca2ec348c0c01e0c93fdc89cf6d30bfd1a3211cc3658ecb1ec7fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/steep/drivers/check.rb:358-375 | lib/steep/drivers/stats.rb:134-151 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/drivers/check.rb:358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/steep/drivers/check.rb"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"00634ea3ce6059ee26a4734807969b040caab9115d308052cde96177915ce013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/steep/type_construction.rb:1540-1557 | lib/steep/type_construction.rb:1583-1600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b265939c51ded9c5e64f59bcfef55bb9d0ec2db8f1d3b998016f6f39d08a6b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/steep/diagnostic/ruby.rb:112-126 | lib/steep/diagnostic/ruby.rb:163-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/diagnostic/ruby.rb"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d06eaa5af089a9367abf8310c2fe978a0591a0b95d2c78af71d32b65542054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/steep/type_inference/logic_type_interpreter.rb:332-347 | lib/steep/type_inference/logic_type_interpreter.rb:372-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"db47e3d7173f6c7fc8e16741379e62130ba0706d872ce4cc100013c29cf9f91a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/steep/type_inference/logic_type_interpreter.rb:350-365 | lib/steep/type_inference/logic_type_interpreter.rb:394-409 \u2014 both copies are in the same file, so extract the block into one function there 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/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8451b6bba4a8ea0a59fd9d94cc5ec82a1f49af0713544a130a0a74bcf0a3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/steep/typing.rb:126-141 | lib/steep/typing.rb:239-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/typing.rb:126\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/steep/typing.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8824dd2911da4d5ad3c4d6af43206ae69244978db2ee285723dd37793dccf966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/steep/drivers/stats.rb:128-142 | lib/steep/drivers/watch.rb:40-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/drivers/stats.rb:128\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/stats.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a510ef2308be58ec113110a5eb016a548402760c9a86c692c4b5ec080738d925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/steep/services/completion_provider/ruby.rb:311-324 | lib/steep/services/completion_provider/ruby.rb:341-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a 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/steep/services/completion_provider/ruby.rb"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e12189a50954c12d401643ebeb10ab3ef9bfaead13a5a6eb39ee02a6cf7b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/steep/type_construction.rb:1369-1382 | lib/steep/type_construction.rb:1390-1402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89e3084c3ae6d668805bf09856ce811be87e4505e144464bcf4c86822fc1563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/steep/type_construction.rb:3650-3663 | lib/steep/type_construction.rb:3674-3687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfe43269af03e6466953988bea45b9507561cc2e7370d92a8e1a391275a7cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): lib/steep/drivers/check.rb:357-369 | lib/steep/drivers/stats.rb:133-145 | lib/steep/drivers/watch.rb:45-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/check.rb"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f921a374a555079166368894f10c67a27a50d7720a59e425763543af27b15a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/steep/interface/builder.rb:962-973 | lib/steep/interface/builder.rb:980-991 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/interface/builder.rb:962\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a 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/steep/interface/builder.rb"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ab481530f5d0a6a964a753e5f61b76723710b743bcb27c621778da7ec62906"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/steep/interface/function.rb:604-614 | lib/steep/interface/function.rb:615-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/interface/function.rb:604\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45750bc1da746addc91b8bab280f7d5c15280ce12be9c073b3bc34f87b29205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/steep/services/completion_provider/ruby.rb:41-52 | lib/steep/services/completion_provider/ruby.rb:99-110 \u2014 both copies are in the same file, so extract the block into one function there 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/steep/services/completion_provider/ruby.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31296d0b0c41643b0518006527a62a56e70e5dd9bff9b4bdabf948e0be2e4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/steep/type_construction.rb:2976-2987 | lib/steep/type_construction.rb:3027-3038 \u2014 both copies are in the same file, so extract the block into one function there 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/steep/type_construction.rb"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35579dd3ee012379d69abdde49fc06b939415cbcc8948bfacaba44db2a36bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/steep/services/hover_provider/ruby.rb:168-178 | lib/steep/services/hover_provider/ruby.rb:203-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a 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/steep/services/hover_provider/ruby.rb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6cd2fc459f49e051751b411eaf5ddcfb4621390b6f42097e83b37a48a49aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/steep/type_construction.rb:3379-3388 | lib/steep/type_construction.rb:3451-3461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/type_construction.rb:3379\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":3379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e0d77805df6db1b6b0a615dd5a1708907f8205734230ae9c16a092ca0d090c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/steep/type_inference/logic_type_interpreter.rb:379-389 | lib/steep/type_inference/logic_type_interpreter.rb:424-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/type_inference/logic_type_interpreter.rb:379\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb316259d34df4ceac09f0dbbb641ce01152640b638b4f9eecd53531db3b64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/steep/interface/function.rb:555-564 | lib/steep/interface/function.rb:619-628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/interface/function.rb:555\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/steep/interface/function.rb"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa5bf05045ea884c4d921e4bb7865b315d576e387aa08424be4de849f84fd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 4): lib/steep/interface/builder.rb:659-667 | lib/steep/interface/builder.rb:673-679 | lib/steep/interface/builder.rb:847-853 | lib/steep/interface/builder.rb:856-862 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/interface/builder.rb:659\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/builder.rb"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dba410267b1581ad9d2eaba04e07b6279cbf342f9e23990e81c926eca05d322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/steep/interface/function.rb:534-542 | lib/steep/interface/function.rb:598-606 | lib/steep/interface/function.rb:663-671 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/function.rb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8809c9b674665a617378cca5967280791fed11dd10a1dcfed4b069d881c295b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/steep/drivers/check.rb:372-380 | lib/steep/drivers/checkfile.rb:118-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/steep/drivers/check.rb:370\u0060 calls \u0060push\u0060 and \u0060lib/steep/drivers/checkfile.rb:116\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/check.rb"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f20a14b8a71e4422fd4cf303c2c0be895cb513b1f5eae25d75e3b18b3d99e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/steep/interface/function.rb:669-677 | lib/steep/interface/function.rb:680-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/interface/function.rb:669\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/steep/interface/function.rb"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d91487afd1bfef0e49c0f04d0959d58a1a4ffd20aa9feebbd6988e1868cc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/steep/type_construction.rb:1809-1817 | lib/steep/type_construction.rb:1868-1876 \u2014 both copies are in the same file, so extract the block into one function there 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/steep/type_construction.rb"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78e14ee0aa572d721d42efca3759fb899400627739ed00633c987cfde7e03af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/steep/type_construction.rb:1841-1849 | lib/steep/type_construction.rb:1899-1907 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/type_construction.rb:1841\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/steep/type_construction.rb"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e188cec0e5a448f285f7ad20b4a930444c4524df98decc2b46961174787feaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/steep/type_construction.rb:2778-2786 | lib/steep/type_construction.rb:2792-2800 \u2014 both copies are in the same file, so extract the block into one function there 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/steep/type_construction.rb"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6ab03113935e7971da9a045f725bdcd7f5b4bfe1e06e99a7795823ca5b51d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/steep/server/lsp_formatter.rb:278-285 | lib/steep/server/lsp_formatter.rb:346-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/server/lsp_formatter.rb:278\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/lsp_formatter.rb"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4844c138a36606291b4ef08501a3177b978511b2f3bdf27b794f42cbe71af52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): lib/steep/signature/validator.rb:347-352 | lib/steep/signature/validator.rb:423-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/signature/validator.rb:423\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/signature/validator.rb"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24e1b958dd7968f0164fce1c0e23628c1ea8f987024207fab9026d8df26f2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): lib/steep/daemon/server.rb:98-103 | lib/steep/drivers/checkfile.rb:32-38 | lib/steep/drivers/stats.rb:124-130 | lib/steep/drivers/watch.rb:36-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/daemon/server.rb"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f95198f964ae94af831ba085e426c66a73da338f7f38ddaab20ce81a4d831f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/steep/subtyping/check.rb:411-417 | lib/steep/subtyping/check.rb:473-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b202fe9372b558ca453a8c3a19bb229621436d28c42059a333801f11616cd778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/steep/interface/builder.rb:605-610 | lib/steep/interface/builder.rb:628-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/steep/interface/builder.rb:605\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/steep/interface/builder.rb"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7c284d45d580768ed366b33618e7be0b129d2a392965831c4a97442e90bda3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/steep/subtyping/check.rb:423-428 | lib/steep/subtyping/check.rb:454-459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/subtyping/check.rb"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7fc36cf2cc7d9a4263a977ead0c07d4f583bbf23dcf1552e49ddd1050692b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/steep/interface/builder.rb:201-205 | lib/steep/interface/builder.rb:235-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/interface/builder.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa08aa2c1d14dd6eab06e6a1b1801251828d8a4671b4f2a8ec308ebe9f8218c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/steep/server/master.rb:982-986 | lib/steep/server/master.rb:1061-1065 \u2014 both copies are in the same file, so extract the block into one function there 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/steep/server/master.rb"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"3243e5de600995206c11484e64504b77e98c709b6e751d5597bd4025a5cde7a8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CaseWhen (LCOM4 11): CaseWhen\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/steep/type_inference/case_when.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5065e1fdb51fa34bdd1c786bd0caa7fde548561de3193a67a5a036112f309d7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TypeEnv (LCOM4 11): TypeEnv\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/steep/type_inference/type_env.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b32e3fb7fe2a9d3bdaedc9be48cb1cbfc067f727f67057c88faca20251844f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Ruby (LCOM4 10): Ruby\u0027s methods fall into 10 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 10 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/steep/locator.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"df922c12ae451ad1cd2ef98bf767133fe9b3c768833c3b17fbeb3709f9ad358c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SignatureHelpProvider (LCOM4 10): SignatureHelpProvider\u0027s methods fall into 10 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 10 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/steep/services/signature_help_provider.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1af7ce372fddbd4823063025af3db81ba8e45c66f0c6626765c9af306438636"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TypeConstruction (LCOM4 10): TypeConstruction\u0027s methods fall into 10 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 10 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/steep/type_construction.rb"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"37263761ae5efa7857dd6b5f42d31558a4749eb00a4de4396829f94000cc6097"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WhenPatterns (LCOM4 10): WhenPatterns\u0027s methods fall into 10 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 10 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/steep/type_inference/case_when.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7f8e62f222092e9b134d4e5f718a04d956cb95ca292bca146522969ea1898d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Ruby (LCOM4 9): Ruby\u0027s methods fall into 9 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 9 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/steep/services/completion_provider/ruby.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a94b6ecb37cb13e21f09bac03947491ef2bf763b9796c00b20cbfdc02cbda22"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Init (LCOM4 5): Init\u0027s methods fall into 5 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 5 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/steep/drivers/init.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"366226ef8c83d041724523c28a54303711ac9028ffe44b32d3eb0e72440bcc2c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Annotations (LCOM4 4): Annotations\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/steep/drivers/annotations.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f42f73263ae396fae3b7f98c3f5a46096d504c8826cd77f325962848bf1fa6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Langserver (LCOM4 4): Langserver\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/steep/drivers/langserver.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0047a3a3c2bf8e4a97253c6b94cb1118435868f54217e562313d553936d231c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PrintProject (LCOM4 4): PrintProject\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/steep/drivers/print_project.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6006aa59ba545c2e117273ceca421a1aded1d11883d10cde9c5ee784daa9add"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Worker (LCOM4 4): Worker\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/steep/drivers/worker.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a244d1cb286e01bb8e75b277efcfc8dd10f729285afdcde4f9cc50687fb8790"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SignatureService (LCOM4 4): SignatureService\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/steep/services/signature_service.rb"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9850929125893c5df8daa0b11d7a9ff57e9ee3efde0fa4ce7d6c0b8d536af071"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/type_construction.rb: lib/steep/type_construction.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 376 in TypeConstruction.synthesize at line 732. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/type_construction.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/steep/type_construction.rb"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a37fd9981586c69ea61ab195809f083dd75e96bfcce3801c7f65384cdb7860"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/server/master.rb: lib/steep/server/master.rb changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Master.process_message_from_client at line 452. Frequent change and high complexity in one file compound: schedule 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-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/server/master.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/steep/server/master.rb"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c484ed68851b6e3781c48e08c5f49a6347955c99892f5cc0f9cba7dc6f9b0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/server/type_check_worker.rb: lib/steep/server/type_check_worker.rb changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TypeCheckWorker.handle_job at line 121. Frequent change and high complexity in one file compound: schedule 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-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/server/type_check_worker.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/steep/server/type_check_worker.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2457bc7953e4e0c41a72f8b67b57aece10591a1c23752afe52145949460c5fa0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/subtyping/check.rb: lib/steep/subtyping/check.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Check.check_type at line 185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/subtyping/check.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/steep/subtyping/check.rb"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3a87e913073f175e75b0d893364e5daa82f7affda3a6715f931589ea3ed55e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/daemon/server.rb: lib/steep/daemon/server.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Server.run at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/daemon/server.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/steep/daemon/server.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac6cff69d87298aafc5f97a59e9cb8425d0487daa5388d66969842f9cb8d040"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/drivers/checkfile.rb: lib/steep/drivers/checkfile.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Checkfile.run at line 27. Frequent change and high complexity in one file compound: schedule 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-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/drivers/checkfile.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/steep/drivers/checkfile.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3109fdae7d1c16fd158f2b2fee45414f09752b9157b31ec21d7681319feec6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/server/lsp_formatter.rb: lib/steep/server/lsp_formatter.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LSPFormatter.format_hover_content at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/server/lsp_formatter.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/steep/server/lsp_formatter.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bfc46454a4ea050a4ee34e3fa0dbbeebfebbf885a4b45935cf30616e8feb3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/drivers/watch.rb: lib/steep/drivers/watch.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Watch.run at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/drivers/watch.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/steep/drivers/watch.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"03089471e6369ea889b162e2e936eda72879b76212ab659952a71e2c015ff55b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/steep/server/rbs_entry_builder.rb: lib/steep/server/rbs_entry_builder.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RBSEntryBuilder.members at line 105. Frequent change and high complexity in one file compound: schedule 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-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 09:08:26 \u002B09:00\u0027 --until=\u00272026-10-20 09:08:26 \u002B09:00\u0027 --full-history --no-merges -- lib/steep/server/rbs_entry_builder.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/steep/server/rbs_entry_builder.rb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64cfc1a34e77fb8d557596f5e5bc1c6a2b8ba3dec679f47c7aa6563e31cf628"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The README begins with a one-line description (\u0027Steep - Gradual Typing for Ruby\u0027) but the body never explains what Steep does or its project scope beyond the three-phase usage steps. State what Steep is and why it is needed in the first paragraph."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: The Installation section lists \u0027Install via RubyGems\u0027 with a one-line install command but does not show how to run or build the project. Add an Install/Build sub-section covering setup, a quick start (run steep init), and any prerequisites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6bfcd5c6ae231d1b8ee99bced50b832d1f61cde9da6cbb533467b879a57db"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: Usage is written as prose with steps (\u0027### 0. \u0060steep init\u0060\u0027) but the body ends before showing how to run it or what output to expect. Add a short \u0027How to Run It\u0027 section describing the first command and its effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1355eb4e127a4bc9236772ce1c46f09510aa9286e7a06d1e47f308229df19049"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no contributor guidance: The README does not mention any contribution guidance, unlike the release docs that do. Add Contributing notes covering pull request process, review expectations, and how to test changes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620f29787918fa3406ae55cb63eefa1b50410845435c4e47bda852816aaea084"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate intent with confusing naming. Both methods appear to perform performance measurement/logging. The existence of \u0060measure\u0060 and \u0060measure2\u0060 suggests a refactoring where the old method was kept or a new one was added without removing the old, or they serve subtly different purposes (e.g., threshold handling) that are not reflected in the names.: Unify into a single \u0060measure\u0060 method with optional keyword arguments for threshold, or rename \u0060measure2\u0060 to something descriptive if it serves a distinct purpose (e.g., \u0060measure_unchecked\u0060). (signatures: Steep.measure(message, level, threshold) | Steep.measure2(message, level))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d3b5d74d56157fb9509fcaf0677210bc1457657a118f196fcc1e7017222e6719"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent arity for getter/setter pair. The getter \u0060[]\u0060 takes 5 arguments, while the setter \u0060[]=\u0060 takes 6 arguments (including the value). While this is standard Ruby for \u0060[]=\u0060 vs \u0060[]\u0060, the getter signature here explicitly lists all lookup keys as parameters rather than returning a hash or object, which is unusual for a cache interface and makes the API verbose compared to typical key-based lookups.: Consider if a simpler key-based lookup is possible, or if the getter should return a structured object containing the bounds/value to reduce parameter noise. If the current design is intentional, ensure documentation clarifies that \u0060[]\u0060 is a multi-key lookup. (signatures: CacheOff.[](relation, self_type, instance_type, class_type, bounds) | CacheOff.[]=(relation, self_type, instance_type, class_type, bounds, value))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5e7a6d9b0a5fc504bfd9ed6dfac4e37b816b275b27efd22e5e7fb6d176fae192"}},{"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 (31969 LoC, 791 module-visible types across 42 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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad564d0856e728bcb96540c434919fb9b6c8bf5f65ce9c9cd6d6a8a2f939536f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd3a2b74108e2d33a29a82263138a3dae0026537818c18fc17f93b8888991680"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b4a3ae2a11b632e45536f02db5a65457a1ac951d553fdea23f7dd50d6150339"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fccf8363e4f6c91021d62c429d41bc1cddaee97aaa465c3319c33e441ee47856"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d07359526ec33dfeb9ca173208559ebcf97c967cbc6e0ff6e8fb3597b08e9f8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"338407871e9c53d2625a5754ccc8f84f16e799149817c1d1e310aef9e6213485"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"194a1865ac28c4ae38c004b2601f2b28923cef7e57a09e701d1f0c62e1a4f16b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30b97f44eac84c325b44cfe29f931d31a182cdf1f3f2d1ca77a1856c33234205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5fc97a9729468362e107fb49d2e327b988cc845ab96d22d73339825201e3d9df"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5892361ab91b7ab7b1fc7669eb23f2ac5379a3b589ff20cf095b480c4926b5c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2d8d956a986c30ae057f58274d9f0f714681f301dde1faedb94d9c5b3b15c07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f9e690582b7b9d1c444794fbd965581ee43586199c8587735ad6273e8d23f53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"189dd109990d5716c189e10498af70eebb1c978894719e778f923ea45258abc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5689d3d7b6b6416c87e1c7712e12944ff02135fe808aee514ab67ee36299b209"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a82afb48c39b316597593cfe43a47153c809eb3c6008b8ca6cd3b4727582a390"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20f341cddb3600ea4d7f0fda7dda2112a67a54c643cb36d66e167bb3210530dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4336d76b974b991aa312d8680b2d6bd739a92dedc51cc715fd45e1d7b67e52ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"feeacd60f7fef62d2f33f4b86ebec4bf6ee5acbd89ff0293c22d86c6dc91cb5b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40a9d0440b515aa509e9b461eb4d4161ae2953e4266a1cc82bf33c31336d5537"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be852cff541397a71896ec252bb86a6ab6d72379071f151277b23b4d0203a25c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28a4cce7ed8cf79169d69e1f378210da8e29e9611f31091633e3c8f4a4fae0a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"382b7a6f4a5964ff95492de7fb4d778a75092d3c51fd5694cf16796c214cb174"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5e0136ce3c804ddd154fb2cd168dcb59c04c9e40929b2f1ce566d4b0310d7c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33a401479e63b0b3df8aa9ef99d9fe96ffdbdf36843d93c0a640c32a1149046b"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d75c6df494752018bc9bf39ca2e4d87eab038595bcb3d7520aeee5f49f72ada6"},"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":"d865a37607f52e64f0bdf98f0673292e6638b81757bb7316909055c3e3b43d97"},"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":"0bbacec10ca3c40b05c1af9b97edf8e0af8c6500d6c88f3180f788ede388c3db"},"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":"ced610cc1e0503a31c3a47bb0534527aa1cf68d3270bef23a164e6a5586b1d51"},"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":"e5f18b40fe9891f005d3b564ecca88894457351341a87c95da4715f1aa07a834"},"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":"de8d0bbe0ff71846b0817ab945a942bcfd8c1b4c87afc4154ca85a7f3d031878"},"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":"b3878ab6b7d259640a732148f7afb04e6a483b37c437dc7fcff47ce9f50f52b8"},"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":"f8a3f7c928deec8520ca4346dc2cbc90474e1cb6c29344d99392194c1dc66eeb"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 81 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 and example/demo trees and test files identified by path convention, largest first; 81 of the 269 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/steep/drivers/diagnostic_printer/code_formatter.rb, lib/steep/rake_task.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/steep/drivers/diagnostic_printer/code_formatter.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e46514917284fb1e3feb4353c3308f90e964e13ce26247c9da2672faa0568"}},{"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/steep/rake_task.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5ebfd32d544cea44e4cb85a6e57ed0739e0f5f490fe7b13b1f8f8992d7fb22"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: type_construction.rb \u2194 typing.rb: \u0060lib/steep/type_construction.rb\u0060 and \u0060lib/steep/typing.rb\u0060 change together 67% of the time (18 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u00603e1cf457\u0060 feat: support the \u0060it\u0060 block parameter; \u0060c8f120f8\u0060 Fix type errors; \u0060e23c40d2\u0060 Delete ContextArray \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/type_construction.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d4d5c98c86b6b729e5f8ae16848959d2bfc38fa88c5f3dbe5d51e7ab530d50"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: check.rb \u2194 watch.rb: \u0060lib/steep/drivers/check.rb\u0060 and \u0060lib/steep/drivers/watch.rb\u0060 change together 60% of the time (15 of the 25 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u00605a13cb2f\u0060 Remove the path assignment from the typecheck workers; \u00608ca88086\u0060 Make \u0060$/steep/typecheck\u0060 a request, rather than a notification; \u0060facb938b\u0060 Typed notification types \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/check.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f377e020a14ebb81799528f5d3db40a89475011518b78791c357770305a4ee63"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: master.rb \u2194 type_check_worker.rb: \u0060lib/steep/server/master.rb\u0060 and \u0060lib/steep/server/type_check_worker.rb\u0060 change together 52% of the time (33 of the 64 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 33 shared commits counted here, the most recent 3 are \u00606441c157\u0060 Send the related locations of diagnostics as relatedInformation; \u0060c1f9258a\u0060 Index the RBS files in the typecheck workers; \u0060c64892ed\u0060 Answer workspace/symbol from the environments of the master \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/master.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e99e11826b5be2a50ea392c19bba3c6b27e80496906bf347a3e6235fd3d999"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: change_buffer.rb \u2194 master.rb: \u0060lib/steep/server/change_buffer.rb\u0060 and \u0060lib/steep/server/master.rb\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00607246bc93\u0060 Remove activesupport dependency; \u00608ad07cb9\u0060 Handle non-utf8 files; \u00603437aa5c\u0060 Load files in master process \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/server/change_buffer.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"833bf0398ffdc2a123f7e151ef4b47223b7c7209fe1458af6036f1e62656e316"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: annotations.rb \u2194 target.rb: \u0060lib/steep/drivers/annotations.rb\u0060 and \u0060lib/steep/project/target.rb\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00604fc56899\u0060 Make \u0060implicitly-returns-nil\u0060 opt-in; \u006095c7a8c0\u0060 EnvironmentLoader instatntiation requires Project; \u006019f41a46\u0060 Rename SignatureValidationErrorStatus \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/drivers/annotations.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ac2671279c5d8946f4264d5b0d1c6a869f270ff963911b4d0fef7a633321a2"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"070c5d26cd47b9fdcb1e0dc63b180dfbaf1d18bcd2a514e0e6b6f7f4ace4f4ab"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060fizz_buzz\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/toplevel/a.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e439cb03e1f44d31714c7b7d59f0257e6dc8a454685cf28933ed0814428373be"}},{"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":"test/completion_provider/type_name_test.rb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb335037252b57c1f2b8e92765951281d258e028356b1d84d9ff567f1e8a101e"}},{"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":"test/completion_provider/type_name_test.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"26047fa23f23de17aa675e79b8ab91c6f7af6a2f1d50090cf3c2462af2cd0632"}},{"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":"test/validation_test.rb"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0662169e23a5c2735323496299bf954489c47615853271c7141bb3f148d24609"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: doc/narrowing.md links to \u0060../guides/narrowing/narrowing.md\u0060, but \u0060guides/narrowing/narrowing.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/narrowing.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15f5d42c9d5bf30692692e899b48ca63ff48e561cfbfae96f24c5ef10c165d0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: doc/narrowing.md documents the environment variable \u0060RECEIVER_IS_NIL\u0060, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/narrowing.md"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1fdcff88742598c1555ce90d595179dcef564a10ed01e49f1aa320435dc529"}},{"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 15569 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":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060Digest::SHA256\u0060 or \u0060OpenSSL::Digest.new(\u0022SHA256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/steep/daemon/configuration.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c5b2d3d6ccbf16d41ab7c91da655e03190405e24bec9fba77b8d196db04616"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060method_type.type.params.nil? || method_type.type.params.optional?\u0060 appears character-identically in 2 files \u2014 lib/steep/type_construction.rb, lib/steep/type_inference/logic_type_interpreter.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/steep/type_construction.rb"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ca802e81dbea05c77af5447af4e4a698d71e3a3761737bbc731f84ecdcc6e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060other.is_a?(self.class) \u0026\u0026 other.type == type\u0060 appears character-identically in 2 files \u2014 lib/steep/ast/annotation.rb, lib/steep/interface/function.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/steep/ast/annotation.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e66961132ad8fc2d3a02350d1c3c15846591a86095c46bf6bbf575002f0983"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.begin \u003C= position \u0026\u0026 position \u003C= range.end\u0060 appears character-identically in 2 files \u2014 lib/steep/locator.rb, lib/steep/source.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/steep/locator.rb"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7143c4191ab363ac74c4d2ebe1e460fa0edc0d266543bbd5e8aa1d4da42cb90c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source_pattern =~ path \u0026\u0026 inline_source_pattern !~ path\u0060 appears character-identically in 2 files \u2014 lib/steep/project/group.rb, lib/steep/project/target.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/steep/project/group.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2f9622f394ee9f36ec13eeae89ed06235a9610c261dc46b890a1faf94da2c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.options.collection_config_path || raise\u0060 appears character-identically in 2 files \u2014 lib/steep/daemon.rb, lib/steep/drivers/utils/driver_helper.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/steep/daemon.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ffd5ef9ab135bb7e96f891666a3d214f0d0b69bda577d3685947447d28f2d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type.is_a?(AST::Types::Name::Instance) or raise\u0060 appears character-identically in 2 files \u2014 lib/steep/type_construction.rb, lib/steep/type_inference/block_params.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/steep/type_construction.rb"},"region":{"startLine":5134}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b23d2ad2019eaa14936329f2f3580a643126806012dd88970df1cd3848561e"}},{"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/steep/daemon/server.rb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70c8ad0876878fad17cb510f29c9dac72867192e457383a85e4926cc5192fd1"}},{"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/steep/daemon/server.rb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf93afa1cc472ac5d57f6e25a8c91a4bac2b2eeffe4d7a4d8d2d38b8b1703239"}},{"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/steep/daemon/server.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"57354a05c1a027da1ea4e55c9ca236f26cce258b0a83d73e6bcfb44c3db6aaa8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue return\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/steep/interface/function.rb"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caa1691421c5184ffb04419f9420f14e0543df4778fe4952815242e2486a6c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue return\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/steep/interface/function.rb"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89e7b25a0fe3be53d5f2b31be52171cc52e88ae4422f21cd86af53bc7f14a1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue ParsingError, StandardError\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/steep/server/goto_resolver.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82a1c4d5b7fa6c658bd4f1049d73c0991b3b78558f14e22f621a706ba1e1eff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue ParsingError, StandardError\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/steep/server/goto_resolver.rb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"54525b8dbf6409a6e1b5a165c229ae0c4dfa370d1307f7fe45cbea40e25e135b"}},{"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/steep/services/symbol_provider.rb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae6f67ef6b11e0f4bcbfbe02256eb8a41d6cd67b8aef79291fc81eacada94de"}},{"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/steep/services/symbol_provider.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e06d4e6c8403601e6078c08b3d7b6dedafcd9f848909fc8d2baecfa71640aae"}},{"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/steep/services/hover_provider/ruby.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc3454ccae3588ae314f292b61ca84bcaa9f223a2726688f07846860f839bff"}},{"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/steep/type_inference/logic_type_interpreter.rb"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc2a50b14199fa856cc16c35d1bf522011f646b461cf7a202c3f9f97d209874"}},{"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":"smoke/rescue/a.rb"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ae128ff9df2f076256cc90c1f35a3cd7dc007e86e99bce8dd2d246eac1af0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"smoke/rescue/a.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33391c80ff89e8d51da7c521012e44da385601c8fc6c67824bc9128a21f8b43"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"smoke/rescue/a.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"409018f40789685e2e381576ec6b291b5b909edf3588aaa22f4fa1c7ad55a996"}},{"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":"smoke/rescue/a.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b90534e43d309895620434ff2e965ee5c33e7b13bd3d25801dc0d1e17eef26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/rescue/a.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ac1ecef1abcd8b286b5b873794b2fcb42ce46eed4d744d1d0e7d0ac26e162f"}}],"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-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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":39,"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."]}]}